Characterizing 2k-critical graphs and n-extendable graphs

DOI10.1016/J.DISC.2004.06.013zbMATH Open1053.05100OpenAlexW1972674207MaRDI QIDQ1886352FDOQ1886352

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

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

Cited In (6)

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

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)