@article {
author = {Paramaguru, N. and Sampathkumar, R.},
title = {Modular chromatic number of $C_m \square P_n$},
journal = {Transactions on Combinatorics},
volume = {2},
number = {2},
pages = {47-72},
year = {2013},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2013.2943},
abstract = {A modular $k\!$-coloring, $k\ge 2,$ of a graph $G$ is a coloring of the vertices of $G$ with the elements in $\mathbb{Z}_k$ having the property that for every two adjacent vertices of $G,$ the sums of the colors of their neighbors are different in $\mathbb{Z}_k.$ The minimum $k$ for which $G$ has a modular $k\!$-coloring is the modular chromatic number of $G.$ Except for some special cases, modular chromatic number of $C_m\square P_n$ is determined.},
keywords = {modular coloring,modular chromatic number,Cartesian product},
url = {https://toc.ui.ac.ir/article_2943.html},
eprint = {https://toc.ui.ac.ir/article_2943_5fa15d9e433e3cf4e5d1849c0214c4df.pdf}
}