Pages that link to "Item:Q2515569"
From MaRDI portal
The following pages link to Factor-critical graphs with the minimum number of near-perfect matchings (Q2515569):
Displaying 6 items.
- Ear decomposition of factor-critical graphs and number of maximum matchings (Q745954) (← links)
- On tight components and anti-tight components (Q897283) (← links)
- 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings (Q1690578) (← links)
- PM-compact graphs and vertex-deleted subgraphs (Q2087670) (← links)
- A note on \(m\)-near-factor-critical graphs (Q2311372) (← links)
- On the structure of graphs with exactly two near-perfect matchings. (Q2918632) (← links)