4-regular claw-free IM-extendable graphs
From MaRDI portal
Publication:1781983
Recommendations
Cites work
- scientific article; zbMATH DE number 1286491 (Why is no real title available?)
- scientific article; zbMATH DE number 1471760 (Why is no real title available?)
- Degree conditions of induced matching extendable graphs
- Graph theory
- Independent-set-deletable factor-critical power graphs
- Induced matchings
- Induced matchings in bipartite graphs
- Matching theory
- Maximal IM-unextendable graphs
Cited in
(7)- Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
- Edge-deletable IM-extendable graphs with minimum number of edges
- General induced matching extendability of \(G^3\)
- scientific article; zbMATH DE number 1475160 (Why is no real title available?)
- Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges
- A note on characterization of the induced matching extendable Cayley graphs generated by transpositions
- scientific article; zbMATH DE number 7499157 (Why is no real title available?)
This page was built for publication: 4-regular claw-free IM-extendable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781983)