Matchings in 3-vertex-critical graphs: the odd case (Q879342): Difference between revisions

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.