Abstract
We study a variant of graph coloring which requires that every color class contains a vertex which sees all other colors. We prove hardness results in of bipartite graphs, bounds for planar graphs and we study the parameter for random graphs.