A characterization of 3--critical graphs which are not bicritical
From MaRDI portal
Publication:2224855
Recommendations
Cites work
- Domination critical graphs
- Hamiltonian properties of domination-critical graphs
- Hamiltonicity of connected domination critical graphs.
- Independence and hamiltonicity in 3-domination-critical graphs
- Matching properties in domination critical graphs.
- On k-factor-critical graphs
- Some results related to the toughness of 3-domination critical graphs
- The diameter of domination k‐critical graphs
Cited in
(11)- Matching properties in domination critical graphs.
- Bicritical domination
- Some structures of \(3-({\gamma}_c, 2)\)-critical graphs which are not \(3-{\gamma}_c\)-critical
- scientific article; zbMATH DE number 2073945 (Why is no real title available?)
- Maximal 3--vertex-critical graphs
- Characteristics of (,3)-critical graphs
- Factor-bicriticality in connected domination critical graphs
- A characterization of graphs with semitotal domination number one-third their order
- Edge weighting functions on the semitotal dominating set of claw-free graphs
- Semitotal domination in claw-free graphs
- A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
This page was built for publication: A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224855)