The enumeration of near-perfect matchings of factor-critical graphs

DOI10.1016/S0012-365X(01)00204-7zbMath0997.05081OpenAlexW2069195362MaRDI QIDQ5957718

Jianxiu Hao, Yan Liu

Publication date: 3 July 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00204-7

zbMATH Keywords

bicritical graphsfactor-critical graphsnear-perfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings ⋮ Ear decomposition of factor-critical graphs and number of maximum matchings ⋮ Factor-critical graphs with given number of maximum matchings ⋮ Graphs isomorphic to their maximum matching graphs

This page was built for publication: The enumeration of near-perfect matchings of factor-critical graphs