Pages that link to "Item:Q745954"
From MaRDI portal
The following pages link to Ear decomposition of factor-critical graphs and number of maximum matchings (Q745954):
Displaying 7 items.
- Factor-critical graphs with given number of maximum matchings (Q1015441) (← links)
- 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings (Q1690578) (← links)
- On cycle-nice claw-free graphs (Q2138970) (← links)
- A note on \(m\)-near-factor-critical graphs (Q2311372) (← links)
- Ear decomposition and induced even cycles (Q2422747) (← links)
- An <i>O</i> ( <i>VE</i> ) algorithm for ear decompositions of matching-covered graphs (Q2944500) (← links)
- Even cycles and perfect matchings in claw-free plane graphs (Q3386627) (← links)