The characterization of \(p\)-factor-critical graphs

DOI10.1007/s10255-022-1064-xzbMath1484.05170OpenAlexW4210303779MaRDI QIDQ2115227

Shao-hui Zhai, Er-ling Wei, Fu Ji Zhang

Publication date: 15 March 2022

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-022-1064-x

zbMATH Keywords

transversalperfect matching\(p\)-factor-critical graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Minimally \(k\)-factor-critical graphs for some large \(k\) ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ Minimum degree of minimal \((n-10)\)-factor-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
• Extendability and factor-criticality
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs
• Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs
• On k-factor-critical graphs
• Factor-criticality and matching extension in DCT-graphs
• Covering Problems: Duality Relations and a New Method of Solution

This page was built for publication: The characterization of \(p\)-factor-critical graphs