A characterization of maximal non-k-factor-critical graphs

DOI10.1016/J.DISC.2006.05.036zbMATH Open1114.05076OpenAlexW1986474393MaRDI QIDQ861799FDOQ861799

Authors: N. Ananchuen, Louis Caccetta, W. Ananchuen 

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

Recommendations

• On \(k\)-factor-critical graphs
• Factor-critical graphs with given number of maximum matchings
• Factor-critical graph \(G\) with \(|V (G)|+2\) maximum matchings
• The characterization of \(p\)-factor-critical graphs
• scientific article; zbMATH DE number 1191210

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)

Cites Work

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

Cited In (10)

• Closure and factor-critical graphs
• The characterization of \(p\)-factor-critical graphs
• On \(k\)-factor-critical graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs
• Title not available (Why is that?)
• The characterization of extremal factor-critical graphs on the Klein bottle
• Generalization of matching extensions in graphs. III
• Minimally \(k\)-factor-critical graphs for some large \(k\)

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

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