Algorithmic aspects of dominator colorings in graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
| Hi-index | 0.00 |
A graph has a dominator coloring if it has a proper coloring in which each vertex of the graph dominates every vertex of some color class. The dominator chromatic number 娄Öd(G) is the minimum number of color classes in a dominator coloring of a graph G. In this paper we study the dominator chromatic number for the hypercube, Qn = Qn.1 隆Á K2 (with Q1 隆\le= P2, n 隆脻 2), and more generally for bipartite graphs. We then conclude it with open questions for further research.