Total domination in claw-free graphs with minimum degree 2
From MaRDI portal
Publication:932591
DOI10.1016/J.DISC.2007.06.024zbMATH Open1158.05044OpenAlexW2092392611MaRDI QIDQ932591FDOQ932591
Authors: Odile Favaron, Michael A. Henning
Publication date: 11 July 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.06.024
Recommendations
Cites Work
Cited In (14)
- Total domination and matching numbers in claw-free graphs
- Disjunctive total domination in graphs
- Total restrained domination in claw-free graphs with minimum degree at least two
- On a conjecture on total domination in claw-free cubic graphs
- Bounds on total domination in claw-free cubic graphs
- A survey of selected recent results on total domination in graphs
- Locating-total domination in claw-free cubic graphs
- Total restrained domination in claw-free graphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in claw-free cubic graphs
- Claw-free graphs with equal 2-domination and domination numbers
- Total dominations in \(P_6\)-free graphs
- Upper total domination in claw‐free graphs
- Domination versus edge domination on claw-free graphs
This page was built for publication: Total domination in claw-free graphs with minimum degree 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932591)