{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T14:37:35Z","timestamp":1758811055510},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,9,1]],"date-time":"2008-09-01T00:00:00Z","timestamp":1220227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s00373-008-0798-4","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T15:24:56Z","timestamp":1221233096000},"page":"349-360","source":"Crossref","is-referenced-by-count":9,"title":["On the Acyclic Chromatic Number of Hamming Graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Robert E.","family":"Jamison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gretchen L.","family":"Matthews","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,13]]},"reference":[{"key":"798_CR1","unstructured":"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\u201360"},{"key":"798_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., McDiarmid, C., Reed, B.: Acyclic colorings of graphs. Random Structures Algorithms 2(3), 277\u2013288 (1991)","DOI":"10.1002\/rsa.3240020303"},{"key":"798_CR3","unstructured":"Alon, N., Mohar, B., Sanders, D.P.: On acyclic colorings of graphs on surfaces. Israel J. Math. 94, 273\u2013283 (1996)"},{"key":"798_CR4","doi-asserted-by":"crossref","unstructured":"Best, M.R., Brouwer, A.E.: The triply shortened binary Hamming code is optimal, Discrete Math.17, 235\u2013245 (1977)","DOI":"10.1016\/0012-365X(77)90158-3"},{"key":"798_CR5","doi-asserted-by":"crossref","unstructured":"Borodin, O.V.: On acyclic colorings of planar graphs. Discrete Math. 25(3), 211\u2013236 (1979)","DOI":"10.1016\/0012-365X(79)90077-3"},{"key":"798_CR6","unstructured":"Burnstein, M.I.: Every 4-valent graph has an acyclic 5-coloring. Soob\u0161\u010d Akad. Nauk Gruzin SSR 93, 21\u201324 (1979)"},{"key":"798_CR7","unstructured":"Fertin, G., Godard, E., Raspaud, A.: Acyclic and k-distance coloring of the grid. Inform. Process. Lett. 87(1), 51\u201358 (2003)"},{"key":"798_CR8","unstructured":"Fu, F.-W., Ling, S., Xing, C.-P.: New results on two hypercube coloring problems, preprint"},{"key":"798_CR9","unstructured":"Gr\u00fcnbaum, B.: Acylic colorings of planar graphs. Isreal J. Math. 14, 390\u2013408 (1973)"},{"key":"798_CR10","unstructured":"Jamison, R.E., Matthews, G.L.: Acyclic colorings of products of cycles, Bull. Inst. Combin. Appl., to appear"},{"key":"798_CR11","unstructured":"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\u2013202 (2006)"},{"key":"798_CR12","unstructured":"Jamison, R.E., Matthews, G.L., Villalpando, J.: Acyclic colorings of products of trees. Inform. Process. Lett. 99(1), 7\u201312 (2006)"},{"key":"798_CR13","doi-asserted-by":"crossref","unstructured":"Mohar, B.: Acyclic colorings of locally planar graphs. European J. Combin. 26(3\u20134), 491\u2013503 (2005)","DOI":"10.1016\/j.ejc.2003.12.016"},{"key":"798_CR14","unstructured":"Ngo, H.Q., Du, D.-Z., Graham, R.L.: New bounds on a hypercube coloring problem, Inform. Process. Lett. 84, 265\u2013269 (2002)"},{"key":"798_CR15","doi-asserted-by":"crossref","unstructured":"Nowakowski, R., Rall, D.F.: Associative graph products and their independence, domination and coloring numbers. Discuss. Math. Graph Theory 16(1), 53\u201379 (1996)","DOI":"10.7151\/dmgt.1023"},{"key":"798_CR16","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: On a hypercube coloring problem. J. Combin. Theory Ser. A 108(2), 199\u2013204 (2004)"},{"key":"798_CR17","doi-asserted-by":"crossref","unstructured":"P\u00f3r, 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\u201340, Electron. Notes Discrete Math., 28, Elsevier, Amsterdam, 2007","DOI":"10.1016\/j.endm.2007.01.006"},{"key":"798_CR18","doi-asserted-by":"crossref","unstructured":"Skulrattanakulchai, S.: Acyclic colorings of subcubic graphs. Inform. Process. Lett. 92, 161\u2013167 (2004)","DOI":"10.1016\/j.ipl.2004.08.002"},{"key":"798_CR19","unstructured":"West, D.B.: Introduction to Graph Theory, Prentice Hall 1996, second edition, 2001"},{"key":"798_CR20","unstructured":"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\u2013171"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0798-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0798-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0798-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:28Z","timestamp":1559041108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0798-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["798"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0798-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9]]}}}