Matchings in 3-vertex-critical graphs: the odd case (Q879342): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Nawarat Ananchuen / rank | |||
Property / reviewed by | |||
Property / reviewed by: Wai-Kai Chen / rank | |||
Property / author | |||
Property / author: Nawarat Ananchuen / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Wai-Kai Chen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.09.015 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2090169885 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching properties in domination critical graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matchings in 3‐vertex‐critical graphs: The even case / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex domination-critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex domination‐critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368729 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 1-Factors and Antifactor Sets / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:56, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Matchings in 3-vertex-critical graphs: the odd case |
scientific article |
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