Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
R. Balakrishnan and K. Ranganathan, “A textbook of graph theory”, Second Edition, Universitext, Springer, New York, 2012.
F. Okamoto, E. Salehi and P. Zhang, “A checkerboard problem and modular colorings of graphs”, Bull. Inst. Combin. Appl., 58 (2010), 29–47.
F. Okamoto, E. Salehi and P. Zhang, “A solution to the checkerboard problem”, Int. J. Comput. Appl. Math., 5 (2010), 447–458.
N. Paramaguru and R. Sampathkumar, “Modular chromatic number of C m □ P n ,” Trans. Comb. 2. No. 2. (2013), 47–72.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Paramaguru, N., Sampathkumar, R. (2014). Modular Chromatic Number of C m □ C n . In: Krishnan, G., Anitha, R., Lekshmi, R., Kumar, M., Bonato, A., Graña, M. (eds) Computational Intelligence, Cyber Security and Computational Models. Advances in Intelligent Systems and Computing, vol 246. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1680-3_36
Download citation
DOI: https://doi.org/10.1007/978-81-322-1680-3_36
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1679-7
Online ISBN: 978-81-322-1680-3
eBook Packages: EngineeringEngineering (R0)