A characterization of maximal non-\(k\)-factor-critical graphs

DOI10.1016/j.disc.2006.05.036zbMath1114.05076OpenAlexW1986474393MaRDI QIDQ861799

Nawarat Ananchuen, Watcharaphong Ananchuen, Louis Caccetta

Publication date: 2 February 2007

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

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

zbMATH Keywords

matching\(k\)-extendable graph\(k\)-factor critical graph

Mathematics Subject Classification ID

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

Related Items (1)

Generalization of matching extensions in graphs. III

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On n-extendable graphs
• Extending matchings in graphs: A survey
• Matching extension in \(K_{1,r}\)-free graphs with independent claw centers
• Matching extension and minimum degree
• Extendability and factor-criticality
• On k-factor-critical graphs
• A note onn-extendable graphs
• Factor-criticality and matching extension in DCT-graphs
• Maximal IM-unextendable graphs

This page was built for publication: A characterization of maximal non-\(k\)-factor-critical graphs