Matchings in 3-vertex-critical graphs: the odd case
type: Item
instance of: scholarly article
title: Matchings in 3-vertex-critical graphs: the odd case
zbMATH Open document ID: 1133.05073
author: Michael D. Plummer
author: N. Ananchuen
published in: Discrete Mathematics
publication date: 2007-05-11T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5151764
zbMATH Keywords: matching
zbMATH Keywords: factor-critical
zbMATH Keywords: domination
zbMATH Keywords: 3-vertex-critical
reviewed by: Wai-Kai Chen
MaRDI profile type: Publication
full work available at URL: j.disc.2006.09.015
OpenAlex ID: W2090169885
cites work: Matching properties in domination critical graphs.
cites work: Matchings in 3‐vertex‐critical graphs: The even case
cites work: Vertex domination-critical graphs
cites work: Vertex domination‐critical graphs
cites work: Q4368729
cites work: Matching theory
cites work: 1-Factors and Antifactor Sets
DOI: 10.1016/J.DISC.2006.09.015
Recommended article: Matchings in 3‐vertex‐critical graphs: The even case
Recommended article: Matching and Factor-Critical Property in 3-Dominating-Critical Graphs
Recommended article: Matchings in 3-uniform hypergraphs
Recommended article: Matchings in 3-uniform hypergraphs of large minimum vertex degree
Recommended article: A conjecture on 3-vertex-critical graphs
Recommended article: Matching in 3-uniform hypergraphs
Recommended article: Q5488334
Recommended article: Q4807727
Recommended article: Matchings in graphs of odd regularity and girth
Recommended article: Q4807740
description: scientific article; zbMATH DE number 5151764