Star chromatic number
Andrew Vince · Journal of Graph Theory · 1988
Abstract A generalization of the chromatic number of a graph is introduced such that the colors are integers modulo n , and the colors on adjacent vertices are required to be as far apart as possible.