Edge-deletable IM-extendable graphs with minimum number of edges
From MaRDI portal
Recommendations
Cites work
- 4-regular claw-free IM-extendable graphs
- Degree conditions of induced matching extendable graphs
- Graph theory
- scientific article; zbMATH DE number 1286491 (Why is no real title available?)
- scientific article; zbMATH DE number 3390835 (Why is no real title available?)
- Induced matching extendable graph powers
- Induced matchings
- Maximal IM-unextendable graphs
- The Factorization of Linear Graphs
Cited in
(7)- Characterization of the induced matching extendable graphs with 2 n vertices and 3 n edges
- Minimum \(k\)-critical bipartite graphs
- n-regular (n-2)-edge deletable IM-extendable graphs
- Group connectivity of 1-edge deletable IM-extendable graphs
- Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility.
- The characterization of 1-edge deletable IM-extendable graphs
- scientific article; zbMATH DE number 2230936 (Why is no real title available?)
This page was built for publication: Edge-deletable IM-extendable graphs with minimum number of edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045004)