2000 character limit reached
Disjoint Total Dominating Sets in Near-Triangulations (2205.06464v1)
Published 13 May 2022 in math.CO and cs.DM
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 [Thoroughly dispersed colorings, J. Graph Theory, 88 (2018) 174-191].