Disjoint Total Dominating Sets in Planar Graphs

ABSTRACT The vertex set of any planar graph of minimum degree at least 3 can be colored in two colors so that every vertex has a neighbor of each color. If the graph is a planar triangulation, the coloring can be chosen such that every vertex has a neighbor of its own color and at least two neighbors of the opposite color.