Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
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.
scientific article; zbMATH DE number 2116264