The following pages link to Maximal IM-unextendable graphs (Q5948988):
Displaying 10 items.
- Induced matching extendable graph powers (Q855304) (← links)
- A characterization of maximal non-\(k\)-factor-critical graphs (Q861799) (← links)
- Characterizing defect \(n\)-extendable bipartite graphs with different connectivities (Q882112) (← links)
- Bipartite matching extendable graphs (Q998414) (← links)
- Edge-deletable IM-extendable graphs with minimum number of edges (Q1045004) (← links)
- Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges (Q1699544) (← links)
- 4-regular claw-free IM-extendable graphs (Q1781983) (← links)
- A note on characterization of the induced matching extendable Cayley graphs generated by transpositions (Q2700615) (← links)
- (Q3391327) (← links)
- Induced matching extendable graphs (Q4242938) (← links)