Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs (Q1886352)
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: Characterizing 2k-critical graphs and n-extendable graphs |
scientific article; zbMATH DE number 2116264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs |
scientific article; zbMATH DE number 2116264 |
Statements
Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs (English)
0 references
18 November 2004
0 references
The authors present a new necessary and sufficient condition for a graph to have a perfect matching. Using this condition, they characterize \(2k\)-critical graphs as well as \(n\)-extendable graphs.
0 references
perfect matching
0 references
\(n\)-extendable graph
0 references
\(2k\)-critical graph
0 references
