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

DOI10.1016/S0012-365X(01)00204-7MaRDI QIDQ5957718zbMATH OpenOpenAlexFDO

Authors Yan Liu, Jianxiu Hao

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

factor-critical graphsbicritical graphsnear-perfect matching

Mathematics Subject Classification ID

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

Recommendations

• Factor-critical graphs with the minimum number of near-perfect matchings
• Factor-critical graphs with given number of maximum matchings
• 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings
• Factor-critical graph \(G\) with \(|V (G)|+2\) maximum matchings
• Ear decomposition of factor-critical graphs and number of maximum matchings

Cited in

(9)

• scientific article; zbMATH DE number 1475186 (Why is no real title available?)
• Factor-critical graphs with the minimum number of near-perfect matchings
• On the structure of graphs with exactly two near-perfect matchings.
• Factor-critical graph \(G\) with \(|V (G)|+2\) maximum matchings
• Ear decomposition of factor-critical graphs and number of maximum matchings
• Factor-critical graphs with given number of maximum matchings
• 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings
• Graphs isomorphic to their maximum matching graphs
• Trees maximizing the number of almost-perfect matchings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957718)