The following pages link to (Q4842727):
Displaying 8 items.
- Lexicographic product of extendable graphs (Q974316) (← links)
- Matching connectivity: on the structure of graphs with perfect matchings (Q1689965) (← links)
- Extending perfect matchings to Hamiltonian cycles in line graphs (Q2223459) (← links)
- Counting perfect matchings in \(n\)-extendable graphs (Q2483418) (← links)
- Degree sums, neighborhood unions and matching extension in graphs (Q3972523) (← links)
- On matching extendability of lexicographic products (Q4603945) (← links)
- Matching extension in the powers of \(n\)-connected graphs (Q5284582) (← links)
- Induced cycle path number of derived graphs (Q5298351) (← links)