Maximal IM-unextendable graphs (Q5948988)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1672513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximal IM-unextendable graphs |
scientific article; zbMATH DE number 1672513 |
Statements
Maximal IM-unextendable graphs (English)
0 references
29 March 2002
0 references
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.
0 references
induced matching
0 references
extendable
0 references
0.9072080850601196
0 references
0.8537268042564392
0 references
0.8384320735931396
0 references
