2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings

DOI10.1007/S10255-017-0715-9zbMath1378.05168OpenAlexW2769150269MaRDI QIDQ1690578

Yan Liu, Ming Hua Li

Publication date: 19 January 2018

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-017-0715-9

zbMATH Keywords

maximum matching2-connected graphfactor-critical graph

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Extremal problems in graph theory (05C35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computer-aided design (modeling of curves and surfaces) (65D17) Connectivity (05C40)

Cites Work

• Ear decomposition of factor-critical graphs and number of maximum matchings
• The enumeration of near-perfect matchings of factor-critical graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings