@article{Gera2007OnTD,
title={On the Dominator Colorings in Bipartite Graphs},
author={Ralucca Gera},
journal={Fourth International Conference on Information Technology (ITNG'07)},
year={2007},
pages={947-952}
}

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 <sub>Xd</sub>(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, Q<sub>n </sub> = Q<sub>n-</sub> times K<sub>2</sub> (with Q<sub>1</sub> cong P<sub>2</sub>, n ges 2), and more generally for bipartite graphs. We then conclude it… CONTINUE READING