Factor-critical graphs with given number of maximum matchings

DOI10.1007/S00373-008-0816-6zbMath1227.05213OpenAlexW1989416229MaRDI QIDQ1015441

Yan Liu, Gui Ying Yan

Publication date: 8 May 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0816-6

zbMATH Keywords

maximum matchingfactor-critical graphbicritical graph

Mathematics Subject Classification ID

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

Related Items (1)

On tight components and anti-tight components

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• The enumeration of near-perfect matchings of factor-critical graphs

This page was built for publication: Factor-critical graphs with given number of maximum matchings