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

DOI10.1016/j.disc.2004.06.013zbMath1053.05100OpenAlexW1972674207MaRDI QIDQ1886352

Ning Zhong, Dingjun Lou, R. E. L. Aldred, Derek Holton

Publication date: 18 November 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.06.013

zbMATH Keywords

perfect matching\(n\)-extendable graph\(2k\)-critical graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (6)

Characterization of \(k\)-subconnected graphs ⋮ Bipartite matching extendable graphs ⋮ Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs ⋮ M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles ⋮ Graphs with no \(M\)-alternating path between two vertices ⋮ The characterization of \(p\)-factor-critical graphs

Cites Work

• On n-extendable graphs
• Two results on matching extensions with prescribed and proscribed edge sets
• Extending matchings in graphs: A survey
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• Binding number and toughness for matching extension
• Extension of partial diagonals of matrices. I
• On k-factor-critical graphs
• N‐extendability of symmetric graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs