Disjoint total dominating sets in near‐triangulations
- 1 August 2023
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 105 (1) , 68-77
Abstract
We show that every simple planar near‐triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulations other than the triangle. This affirms a conjecture of Goddard and Henning.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Thoroughly dispersed coloringsJournal of Graph Theory, 2017
- On coupon colorings of graphsDiscrete Applied Mathematics, 2015
- Total Domination in Graphs2013
- 2-List-coloring planar graphs without monochromatic trianglesJournal of Combinatorial Theory, Series B, 2008
- Planar graph colorings without short monochromatic cyclesJournal of Graph Theory, 2004
- Dominating Sets in Planar GraphsEuropean Journal of Combinatorics, 1996
- Regular totally domatically full graphsDiscrete Mathematics, 1990
- Total domination in graphsNetworks, 1980
- Towards a theory of domination in graphsNetworks, 1977
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975