Characterizing 2k-critical graphs and n-extendable graphs

DOI10.1016/J.DISC.2004.06.013MaRDI QIDQ1886352zbMATH OpenOpenAlexFDO

Authors Dingjun Lou, Ning Zhong, 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)

Cites work

• scientific article; zbMATH DE number 4066957 (Why is no real title available?)
• scientific article; zbMATH DE number 166088 (Why is no real title available?)
• scientific article; zbMATH DE number 637272 (Why is no real title available?)
• scientific article; zbMATH DE number 1161241 (Why is no real title available?)
• scientific article; zbMATH DE number 1471076 (Why is no real title available?)
• scientific article; zbMATH DE number 1796979 (Why is no real title available?)
• scientific article; zbMATH DE number 2104723 (Why is no real title available?)
• scientific article; zbMATH DE number 238423 (Why is no real title available?)
• Binding number and toughness for matching extension
• Extending matchings in graphs: A survey
• Extension of partial diagonals of matrices. I
• Graph theory
• N‐extendability of symmetric graphs
• On \(k\)-factor-critical graphs
• On n-extendable graphs
• Two results on matching extensions with prescribed and proscribed edge sets
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886352)