A modular k-coloring, k ≥ 2, of a graph G is a coloring of the vertices of G with the elements in Zk having the property that for every two adjacent vertices of G, the sums of the colors of their neighbors are different in Zk. The minimum k for which G has a modular k-coloring is the modular chromatic number of G. In this paper, except for some special cases, modular chromatic number of Cm □ Cn is determined.
CITATION STYLE
Paramaguru, N., & Sampathkumar, R. (2014). Modular chromatic number of Cm □ Cn. In Advances in Intelligent Systems and Computing (Vol. 246, pp. 331–338). Springer Verlag. https://doi.org/10.1007/978-81-322-1680-3_36
Mendeley helps you to discover research relevant for your work.