A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
From MaRDI portal
Publication:989762
DOI10.1007/s11425-009-0192-6zbMath1209.05174WikidataQ123346738 ScholiaQ123346738MaRDI QIDQ989762
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
05C35: Extremal problems in graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
A note on domination 3-edge-critical planar graphs, A characterization of domination weak bicritical graphs with large diameter, Construction for trees without domination critical vertices
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- On k-factor-critical graphs
- Hamiltonian properties of domination-critical graphs
- Vertex domination-critical graphs
- Factor-criticality and matching extension in DCT-graphs
- Independence and hamiltonicity in 3-domination-critical graphs
- Vertex domination‐critical graphs
- Matchings in 3‐vertex‐critical graphs: The even case