Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
type: Item
instance of: scholarly article
title: Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
zbMATH Open document ID: 1053.05100
author: Dingjun Lou
author: Ning Zhong
author: R. E. L. Aldred
author: Derek Holton
published in: Discrete Mathematics
publication date: 2004-11-18T00:00:00Z
review text: 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.
reviewed by: Lutz Volkmann
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 2116264
zbMATH Keywords: perfect matching
zbMATH Keywords: \(n\)-extendable graph
zbMATH Keywords: \(2k\)-critical graph
MaRDI profile type: Publication
full work available at URL: j.disc.2004.06.013
OpenAlex ID: W1972674207
cites work: N‐extendability of symmetric graphs
cites work: Two results on matching extensions with prescribed and proscribed edge sets
cites work: \(M\)-alternating paths in \(n\)-extendable bipartite graphs
cites work: Q5422499
cites work: Extension of partial diagonals of matrices. I
cites work: Binding number and toughness for matching extension
cites work: On \(k\)-factor-critical graphs
cites work: Q4033701
cites work: Q4304323
cites work: Q4488571
cites work: Q4551374
cites work: Q4818792
cites work: On n-extendable graphs
cites work: Q3800093
cites work: Extending matchings in graphs: A survey
cites work: Q4393233
cites work: Q5287862
DOI: 10.1016/J.DISC.2004.06.013
description: scientific article; zbMATH DE number 2116264