Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs (Q1886352)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
scientific article

    Statements

    Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs (English)
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    perfect matching
    0 references
    \(n\)-extendable graph
    0 references
    \(2k\)-critical graph
    0 references

    Identifiers