Favaron, Odile On \(k\)-factor-critical graphs. (English) Zbl 0865.05061 Discuss. Math., Graph Theory 16, No. 1, 41-51 (1996). Summary: A graph is said to be \(k\)-factor-critical if the removal of any set of \(k\) vertices results in a graph with a perfect matching. We study some properties of \(k\)-factor-critical graphs and show that many results on \(q\)-extendable graphs can be improved using this concept. Cited in 2 ReviewsCited in 38 Documents MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) Keywords:factor; perfect matching; \(q\)-extendable graphs PDFBibTeX XMLCite \textit{O. Favaron}, Discuss. Math., Graph Theory 16, No. 1, 41--51 (1996; Zbl 0865.05061) Full Text: DOI