A conjecture on k-factor-critical and 3- -critical graphs
From MaRDI portal
Publication:989762
DOI10.1007/S11425-009-0192-6zbMATH Open1209.05174OpenAlexW1985501593WikidataQ123346738 ScholiaQ123346738MaRDI QIDQ989762FDOQ989762
Authors: Tao Wang, Qinglin Roger Yu 
Publication date: 23 August 2010
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-009-0192-6
Recommendations
- 3-factor-criticality in domination critical graphs
- On the connectivity and matchings in 3-vertex-critical claw-free graphs
- Factor-critical property in 3-dominating-critical graphs
- A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical
- Matching properties in domination critical graphs.
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Vertex domination-critical graphs
- On the connectivity and matchings in 3-vertex-critical claw-free graphs
- On \(k\)-factor-critical graphs
- Title not available (Why is that?)
- Vertex domination‐critical graphs
- Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
- Some properties of 3-domination-critical graphs
- Matching properties in domination critical graphs.
- 3-factor-criticality in domination critical graphs
- Hamiltonian properties of domination-critical graphs
- Independence and hamiltonicity in 3-domination-critical graphs
- Matchings in 3‐vertex‐critical graphs: The even case
- Factor-criticality and matching extension in DCT-graphs
Cited In (7)
- Title not available (Why is that?)
- A characterization of domination weak bicritical graphs with large diameter
- On the connectivity and matchings in 3-vertex-critical claw-free graphs
- \((3, k)\)-factor-critical graphs and toughness
- Construction for trees without domination critical vertices
- A note on domination 3-edge-critical planar graphs
- 3-factor-criticality in domination critical graphs
This page was built for publication: A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989762)
