Pages that link to "Item:Q1690578"
From MaRDI portal
The following pages link to 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings (Q1690578):
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)
- Factor-critical graphs with given number of maximum matchings (Q1015441) (← links)
- On Cartesian product of factor-critical graphs (Q1926021) (← links)
- A note on \(m\)-near-factor-critical graphs (Q2311372) (← links)
- Factor-critical graphs with the minimum number of near-perfect matchings (Q2515569) (← links)