Disjoint Total Dominating Sets in Near-Triangulations

05/13/2022
by   P. Francis, et al.
0

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].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/05/2023

Independent dominating sets in planar triangulations

In 1996, Matheson and Tarjan proved that every near planar triangulation...
research
11/09/2020

Total domination in plane triangulations

A total dominating set of a graph G=(V,E) is a subset D of V such that e...
research
02/22/2018

Efficient Enumeration of Dominating Sets for Sparse Graphs

Dominating sets are fundamental graph structures. However, enumeration o...
research
11/25/2022

Progress towards the two-thirds conjecture on locating-total dominating sets

We study upper bounds on the size of optimum locating-total dominating s...
research
05/12/2019

Complexity of fall coloring for restricted graph classes

We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), ...
research
07/12/2019

Upper bounds for inverse domination in graphs

In any graph G, the domination number γ(G) is at most the independence n...

Please sign up or login with your details

Forgot password? Click here to reset