Matchings in 3-vertex-critical graphs: the odd case (Q879342)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Matchings in 3-vertex-critical graphs: the odd case |
scientific article; zbMATH DE number 5151764
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Matchings in 3-vertex-critical graphs: the odd case |
scientific article; zbMATH DE number 5151764 |
Statements
Matchings in 3-vertex-critical graphs: the odd case (English)
0 references
11 May 2007
0 references
The paper shows that any 3-vertex-critical graph of odd order with positive minimum degree and at least 11 vertices which has no induced subgraph isomorphic to the bipartite graph \(K(1,5)\) must contain a near-perfect matching, and that any such graph with minimum degree at least three which has no induced subgraph isomorphic to the bipartite graph \(K(1,4)\) must be factor-critical. Finally, it is shown that these results are best possible in several senses.
0 references
matching
0 references
factor-critical
0 references
domination
0 references
3-vertex-critical
0 references
0.98049617
0 references
0.9084499
0 references
0 references
0.89633846
0 references
0.8931634
0 references
0 references
0.8829927
0 references
