{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T18:58:15Z","timestamp":1783450695407,"version":"3.55.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T00:00:00Z","timestamp":1686528000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T00:00:00Z","timestamp":1686528000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00493-023-00047-2","type":"journal-article","created":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T06:02:01Z","timestamp":1686549721000},"page":"1067-1073","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Chromatic Number of the Product of 5-Chromatic Graphs can be 4"],"prefix":"10.1007","volume":"43","author":[{"given":"Claude","family":"Tardif","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,12]]},"reference":[{"key":"47_CR1","unstructured":"Hedetniemi, S.: Homomorphisms of graphs and automata, Technical Report 03105-44-T, University of Michigan. (1966)"},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02579374","volume":"5","author":"M El-Zahar","year":"1985","unstructured":"El-Zahar, M., Sauer, N.: The chromatic number of the product of two $$4$$-chromatic graphs is $$4$$. Combinatorica 5, 121\u2013126 (1985)","journal-title":"Combinatorica"},{"key":"47_CR3","unstructured":"Baum, S., Stiebitz, M.: Coloring of graphs without short odd paths between vertices of the same color class. unpublished manuscript (2005)"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.10165","volume":"46","author":"A Gy\u00e1rf\u00e1s","year":"2004","unstructured":"Gy\u00e1rf\u00e1s, A., Jensen, T., Stiebitz, M.: On graphs with strongly independent color-classes. J. Graph. Theory 46, 1\u201314 (2004)","journal-title":"J. Graph. Theory"},{"issue":"2","key":"47_CR5","doi-asserted-by":"publisher","first-page":"663","DOI":"10.4007\/annals.2019.190.2.6","volume":"190","author":"Y Shitov","year":"2019","unstructured":"Shitov, Y.: Counterexamples to Hedetniemi\u2019s conjecture. Ann. Math. 190(2), 663\u2013667 (2019)","journal-title":"Ann. Math."},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"4299","DOI":"10.1016\/j.disc.2009.01.004","volume":"309","author":"H Hajiabolhassan","year":"2009","unstructured":"Hajiabolhassan, H.: On colorings of graph powers. Discrete Math. 309, 4299\u20134305 (2009)","journal-title":"Discrete Math."},{"key":"47_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF02579376","volume":"5","author":"A Hajnal","year":"1985","unstructured":"Hajnal, A.: The chromatic number of the product of two $$\\aleph _1$$-chromatic graphs can be countable. Combinatorica 5, 137\u2013139 (1985)","journal-title":"Combinatorica"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","volume":"25","author":"L Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz, L.: Kneser\u2019s conjecture, chromatic number, and homotopy. J. Combin. Theory Ser. A 25, 319\u2013324 (1978)","journal-title":"J. Combin. Theory Ser. A"},{"key":"47_CR9","first-page":"209","volume":"32","author":"S Poljak","year":"1991","unstructured":"Poljak, S.: Coloring digraphs by iterated antichains. Comment. Math. Univ. Carolin. 32, 209\u2013212 (1991)","journal-title":"Comment. Math. Univ. Carolin."},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Simonyi, G., Tardos, G.: Local chromatic number. Ky Fan\u2019s Theorem and circular colorings. Combinatorica 26, 587\u2013626 (2006)","DOI":"10.1007\/s00493-006-0034-x"},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00493-021-4781-5","volume":"42","author":"C Tardif","year":"2022","unstructured":"Tardif, C.: The chromatic number of the product of 14-chromatic graphs can be 13. Combinatorica 42, 301\u2013308 (2022)","journal-title":"Combinatorica"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Wrochna, M.: On inverse powers of graphs and topological implications of Hedetniemi\u2019s conjecture. J. Combin. Theory J. Combin. Theory Ser. B 139, 267\u2013295 (2019)","DOI":"10.1016\/j.jctb.2019.02.008"},{"key":"47_CR13","unstructured":"Wrochna, M.: Smaller counterexamples to Hedetniemi\u2019s conjecture, arXiv:2012.13558 [math.CO]"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.11650\/twjm\/1500406890","volume":"2","author":"X Zhu","year":"1998","unstructured":"Zhu, X.: A survey on Hedetniemi\u2019s conjecture. Taiwanese J. Math. 2, 1\u201324 (1998)","journal-title":"Taiwanese J. Math."},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Zhu, X.: A note on the Poljak-R\"odl function. Electron. J. Combin. 27, 3.2-4 (2020)","DOI":"10.37236\/9371"},{"key":"47_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.jctb.2020.09.005","volume":"146","author":"X Zhu","year":"2021","unstructured":"Zhu, X.: Relatively small counterexamples to Hedetniemi\u2019s conjecture. J. Combin. Theory Ser. B 146, 141\u2013150 (2021)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00047-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00047-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00047-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T14:03:22Z","timestamp":1700834602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00047-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,12]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["47"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00047-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,12]]},"assertion":[{"value":"22 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}