The characterization of p-factor-critical graphs
From MaRDI portal
Publication:2115227
Recommendations
Cites work
- scientific article; zbMATH DE number 3144145 (Why is no real title available?)
- scientific article; zbMATH DE number 1191210 (Why is no real title available?)
- scientific article; zbMATH DE number 1151793 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
- Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs
- Covering Problems: Duality Relations and a New Method of Solution
- Extendability and factor-criticality
- Factor-criticality and matching extension in DCT-graphs
- Graph theory
- Matching theory
- On \(k\)-factor-critical graphs
Cited in
(10)- A characterization of maximal non-\(k\)-factor-critical graphs
- scientific article; zbMATH DE number 2108132 (Why is no real title available?)
- Minimum degree of minimal \((n-10)\)-factor-critical graphs
- scientific article; zbMATH DE number 2084268 (Why is no real title available?)
- \(p\)-factor-criticality of vertex-transitive graphs with large girth.
- Extendability and factor-criticality
- The characterization of extremal factor-critical graphs on the Klein bottle
- 3-factor-criticality of vertex-transitive graphs
- 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)