Ear decomposition of factor-critical graphs and number of maximum matchings

DOI10.1007/S40840-014-0092-YzbMath1322.05115OpenAlexW2170194425MaRDI QIDQ745954

Shenlin Zhang, Yan Liu

Publication date: 15 October 2015

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-014-0092-y

zbMATH Keywords

maximum matchingear decompositionfactor-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (5)

On cycle-nice claw-free graphs ⋮ Even cycles and perfect matchings in claw-free plane graphs ⋮ 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings ⋮ Ear decomposition and induced even cycles ⋮ A note on \(m\)-near-factor-critical graphs

Cites Work

• Unnamed Item
• Bipartite graphs with the maximal value of the second Zagreb index
• Dimers and amoebae
• The enumeration of near-perfect matchings of factor-critical graphs

This page was built for publication: Ear decomposition of factor-critical graphs and number of maximum matchings