Abstract
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum number k such that G has an acyclic coloring with k colors. In this paper, acyclic colorings of Hamming graphs, products of complete graphs, are considered. Upper and lower bounds on the acyclic chromatic number of Hamming graphs are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albertson, M.O., Berman, D.M.: The acyclic chromatic number, Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica Inc., Winnipeg, Canada, 1976, 51–60
Alon, N., McDiarmid, C., Reed, B.: Acyclic colorings of graphs. Random Structures Algorithms 2(3), 277–288 (1991)
Alon, N., Mohar, B., Sanders, D.P.: On acyclic colorings of graphs on surfaces. Israel J. Math. 94, 273–283 (1996)
Best, M.R., Brouwer, A.E.: The triply shortened binary Hamming code is optimal, Discrete Math.17, 235–245 (1977)
Borodin, O.V.: On acyclic colorings of planar graphs. Discrete Math. 25(3), 211–236 (1979)
Burnstein, M.I.: Every 4-valent graph has an acyclic 5-coloring. Soobšč Akad. Nauk Gruzin SSR 93, 21–24 (1979)
Fertin, G., Godard, E., Raspaud, A.: Acyclic and k-distance coloring of the grid. Inform. Process. Lett. 87(1), 51–58 (2003)
Fu, F.-W., Ling, S., Xing, C.-P.: New results on two hypercube coloring problems, preprint
Grünbaum, B.: Acylic colorings of planar graphs. Isreal J. Math. 14, 390–408 (1973)
Jamison, R.E., Matthews, G.L.: Acyclic colorings of products of cycles, Bull. Inst. Combin. Appl., to appear
Jamison, R.E., Matthews, G.L.: Distance k colorings of Hamming graphs. Proceedings of the Thirty-Seventh Southeastern International Conference on Combinatorics. Graph Theory and Computing. Congr. Numer. 183, 193–202 (2006)
Jamison, R.E., Matthews, G.L., Villalpando, J.: Acyclic colorings of products of trees. Inform. Process. Lett. 99(1), 7–12 (2006)
Mohar, B.: Acyclic colorings of locally planar graphs. European J. Combin. 26(3–4), 491–503 (2005)
Ngo, H.Q., Du, D.-Z., Graham, R.L.: New bounds on a hypercube coloring problem, Inform. Process. Lett. 84, 265–269 (2002)
Nowakowski, R., Rall, D.F.: Associative graph products and their independence, domination and coloring numbers. Discuss. Math. Graph Theory 16(1), 53–79 (1996)
Östergård, P.R.J.: On a hypercube coloring problem. J. Combin. Theory Ser. A 108(2), 199–204 (2004)
Pór, A., Wood, D.R.: Colourings of the Cartesian product of graphs and multiplicative Sidon sets, 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, 33–40, Electron. Notes Discrete Math., 28, Elsevier, Amsterdam, 2007
Skulrattanakulchai, S.: Acyclic colorings of subcubic graphs. Inform. Process. Lett. 92, 161–167 (2004)
West, D.B.: Introduction to Graph Theory, Prentice Hall 1996, second edition, 2001
Ziegler, G.M.: Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions, in H. Alt (Ed.): Computational Discrete Mathematics, Lecture Notes in Computer Science 2122, Springer-Verlag, Berlin, 2001, 159–171
Author information
Authors and Affiliations
Corresponding author
Additional information
Gretchen L. Matthews: The work of this author is supported by NSA H-98230-06-1-0008.
Rights and permissions
About this article
Cite this article
Jamison, R.E., Matthews, G.L. On the Acyclic Chromatic Number of Hamming Graphs. Graphs and Combinatorics 24, 349–360 (2008). https://doi.org/10.1007/s00373-008-0798-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-008-0798-4