Dominator Colorings in Some Classes of Graphs

A dominator coloring is a coloring of the vertices of a graph such that every vertex is either alone in its color class or adjacent to all vertices of at least one other class. We present new bounds on the dominator coloring number of a graph, with applications to chordal graphs. We show how to compute the dominator coloring number in polynomial time for P4-free graphs, and we give a polynomial-time characterization of graphs with dominator coloring number at most 3.

[1]  O. Ore.  Theory of Graphs , 1962 .

[2]  D. Seinsche.  On a property of the class of n-colorable graphs , 1974 .

[3]  Charles Payan,et al.  Domination-balanced graphs , 1982, J. Graph Theory.

[4]  Michael S. Jacobson,et al.  On graphs having domination number half their order , 1985 .

[5]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[6]  Ralucca Gera,et al.  Dominator colorings and safe clique partitions , 2006 .

[7]  Ralucca Gera.  On dominator colorings in graphs , 2007 .

[8]  Ralucca Gera.  On the Dominator Colorings in Bipartite Graphs , 2007, Fourth International Conference on Information Technology (ITNG'07).