The characterization of p-factor-critical graphs
DOI10.1007/S10255-022-1064-XzbMATH Open1484.05170OpenAlexW4210303779MaRDI QIDQ2115227FDOQ2115227
Authors: Shaohui Zhai, Erling Wei, Fuji 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
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76) Transversal (matching) theory (05D15)
Cites Work
- Graph theory
- Matching theory
- Title not available (Why is that?)
- On \(k\)-factor-critical graphs
- Covering Problems: Duality Relations and a New Method of Solution
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs
- Extendability and factor-criticality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factor-criticality and matching extension in DCT-graphs
- Title not available (Why is that?)
- Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs
- Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
Cited In (7)
- A characterization of maximal non-\(k\)-factor-critical graphs
- Title not available (Why is that?)
- Minimum degree of minimal \((n-10)\)-factor-critical graphs
- Title not available (Why is that?)
- Extendability and factor-criticality
- Minimally \(k\)-factor-critical graphs for some large \(k\)
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical
This page was built for publication: The characterization of \(p\)-factor-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115227)
