Modular Chromatic Number of Cm □ Cn
A modular k-coloring, k ≥ 2, of a graph G is a coloring of the vertices of G with the elements in Z k having the property that for every two adjacent vertices of G, the sums of the colors of their neighbors are different in Z k . 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 C m □ C n is determined.
KeywordsModular coloring Modular chromatic number Cartesian product
- 1.R. Balakrishnan and K. Ranganathan, “A textbook of graph theory”, Second Edition, Universitext, Springer, New York, 2012.Google Scholar
- 2.F. Okamoto, E. Salehi and P. Zhang, “A checkerboard problem and modular colorings of graphs”, Bull. Inst. Combin. Appl., 58 (2010), 29–47.Google Scholar
- 3.F. Okamoto, E. Salehi and P. Zhang, “A solution to the checkerboard problem”, Int. J. Comput. Appl. Math., 5 (2010), 447–458.Google Scholar
- 4.N. Paramaguru and R. Sampathkumar, “Modular chromatic number of C m □ P n,” Trans. Comb. 2. No. 2. (2013), 47–72.Google Scholar