Maximal IM-unextendable graphs
From MaRDI portal
A graph \(G\) is called IM-extendable if every induced matching of \(G\) is included in a perfect matching of \(G.\) Further, \(G\) is maximal IM-unextendable if \(G\) is not IM-extendable but \(G+e\) is IM-extendable for every non-edge \(e\) of \(G.\) In the paper all maximal IM-unextendable graphs are described.
Recommendations
- Induced matchings, maximal IM-extendable graphs and induced matching number
- scientific article; zbMATH DE number 1286491
- scientific article; zbMATH DE number 2230936
- Characterization of the induced matching extendable graphs with 2 n vertices and 3 n edges
- Degree conditions of induced matching extendable graphs
Cited in
(11)- Edge-deletable IM-extendable graphs with minimum number of edges
- Characterization of the induced matching extendable graphs with 2 n vertices and 3 n edges
- 4-regular claw-free IM-extendable graphs
- 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?)
- Induced matchings, maximal IM-extendable graphs and induced matching number
- scientific article; zbMATH DE number 1827735 (Why is no real title available?)
- Induced matching extendable graph powers
- A characterization of maximal non-\(k\)-factor-critical graphs
- Characterizing defect n-extendable bipartite graphs with different connectivities
- Bipartite matching extendable graphs
This page was built for publication: Maximal IM-unextendable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948988)
