Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two
From MaRDI portal
Publication:6570044
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1529462 (Why is no real title available?)
- scientific article; zbMATH DE number 892215 (Why is no real title available?)
- Dominating sets inducing large components
- Dominating sets inducing large components in maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- Domination in digraphs and their direct and Cartesian products
- Domination in graphs with minimum degree two
- Domination versus total domination in claw-free cubic graphs
- Domination-balanced graphs
- Graph theory
- Graphs with large total domination number
- Graphs with unique minimum specified domination sets
- The domination number of plane triangulations
- Total domination in graphs
- Total domination in graphs
- Total domination in maximal outerplanar graphs. II.
Cited in
(2)
This page was built for publication: Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570044)