On a conjecture on total domination in claw-free cubic graphs
From MaRDI portal
Publication:710600
DOI10.1016/j.disc.2010.07.006zbMath1222.05203OpenAlexW2002402864WikidataQ123285354 ScholiaQ123285354MaRDI QIDQ710600
Michael A. Henning, Justin Southey
Publication date: 19 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.07.006
Related Items (10)
Disjunctive total domination in graphs ⋮ Extremal cubic graphs for fault-tolerant locating domination ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ Semipaired domination in claw-free cubic graphs ⋮ Locating-total domination in claw-free cubic graphs ⋮ Semitotal domination in claw-free cubic graphs ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Domination versus total domination in claw-free cubic graphs ⋮ Upper total domination in claw-free cubic graphs ⋮ Triangles and (total) domination in subcubic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Paired-domination in claw-free cubic graphs
- Total domination in claw-free graphs with minimum degree 2
- Bounds on total domination in claw-free cubic graphs
- Claw-free graphs. III: Circular interval graphs
- Claw-free graphs. IV: Decomposition theorem
- Total domination of graphs and small transversals of hypergraphs
- Claw-free graphs. V. Global structure
- A survey of selected recent results on total domination in graphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Claw-free graphs---a survey
- Claw-free graphs. I: Orientable prismatic graphs
- Claw-free graphs. II: Non-orientable prismatic graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total domination in graphs
- Some remarks on domination
This page was built for publication: On a conjecture on total domination in claw-free cubic graphs
