On dominator colorings in graphs
Ralucca Gera · 2007
Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in the graph dom-inates an entire color class. We seek to minimize the number of color classes. We study this problem on several classes of graphs, as well as finding general bounds and characterizations. We also show the relation between dominator chromatic number, chromatic number, and domina-tion number.