Factor-critical graphs with given number of maximum matchings
From MaRDI portal
Publication:1015441
DOI10.1007/S00373-008-0816-6zbMATH Open1227.05213OpenAlexW1989416229MaRDI QIDQ1015441FDOQ1015441
Authors: Yan Liu, Guiying 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
Recommendations
- Factor-critical graph \(G\) with \(|V (G)|+2\) maximum matchings
- 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings
- scientific article; zbMATH DE number 2108132
- Ear decomposition of factor-critical graphs and number of maximum matchings
- The enumeration of near-perfect matchings of factor-critical graphs
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (14)
- Factor-critical graphs with the minimum number of near-perfect matchings
- A characterization of maximal non-\(k\)-factor-critical graphs
- Equimatchable factor‐critical graphs
- 4-factor-criticality of vertex-transitive graphs
- Factor-critical graph \(G\) with \(|V (G)|+2\) maximum matchings
- Title not available (Why is that?)
- Ear decomposition of factor-critical graphs and number of maximum matchings
- Title not available (Why is that?)
- The enumeration of near-perfect matchings of factor-critical graphs
- On tight components and anti-tight components
- A note on \(m\)-near-factor-critical graphs
- 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings
- Title not available (Why is that?)
- On Cartesian product of factor-critical graphs
This page was built for publication: Factor-critical graphs with given number of maximum matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015441)
