{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T23:43:35Z","timestamp":1749599015642},"reference-count":23,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":7611,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1002\/jgt.3190090409","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T07:55:13Z","timestamp":1180425313000},"page":"487-495","source":"Crossref","is-referenced-by-count":34,"title":["On the chromatic number of the product of graphs"],"prefix":"10.1002","volume":"9","author":[{"given":"D.","family":"Duffus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Sands","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. E.","family":"Woodrow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1976-133-5"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.4064\/cm-25-1-49-52","article-title":"On chromatic number of products of two graphs","volume":"25","author":"Borowiecki M.","year":"1972","journal-title":"Colloq. Math."},{"key":"e_1_2_1_4_2","first-page":"369","article-title":"A colour problem for infinite graphs and a problem in the theory of relations","volume":"13","author":"de Bruijn N. G.","year":"1951","journal-title":"Indaga. Math."},{"key":"e_1_2_1_5_2","first-page":"167","article-title":"On graphs of Ramsey type","volume":"1","author":"Burr S. A.","year":"1976","journal-title":"Ars Combinatoria"},{"key":"e_1_2_1_6_2","article-title":"The chromatic number of the product of two 4\u2010chromatic graphs is 4","author":"El\u2010Zahar M.","journal-title":"Combinatorica."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1977-027-1"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01886093"},{"key":"e_1_2_1_9_2","first-page":"109","article-title":"Ein Dreifarbensatz f\u00fcr dreikreisfreie Netze auf der Kugel","volume":"8","author":"Gr\u00f6tzsch H.","year":"1958","journal-title":"Wiss. Z. Martin\u2010Luther\u2010Univ. Halle\u2010Wittenberg Math. Natur. Reihe"},{"key":"e_1_2_1_10_2","first-page":"116","article-title":"\u00dcber eine Konstruktion nicht n\u2010f\u00e4rbbarer Graphen","volume":"10","author":"Haj\u00f3s G.","year":"1961","journal-title":"Wiss. Z. Martin\u2010Luther\u2010Univ. Halle\u2010Wittenberg Math. Natur. Reihe"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80086-4"},{"key":"e_1_2_1_12_2","unstructured":"S. T.Hedetniemi Homomorphisms of graphs and automata. University of Michigan Technical Report 03105\u201044\u2010T 1966."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1979.tb17773.x"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1979.tb32801.x"},{"key":"e_1_2_1_15_2","volume-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz L.","year":"1979"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1968-151-x"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.4064\/cm-3-2-161-162"},{"key":"e_1_2_1_18_2","first-page":"151","volume-title":"Graph Theory, \u0139ag\u00e1w 1981, Lecture Notes in Mathematics 1018","author":"Ne\u0161et\u0159il J.","year":"1983"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90110-1"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(81)80024-X"},{"key":"e_1_2_1_21_2","first-page":"461","article-title":"On the maximal number of edges of critical k\u2010chromatic graphs","volume":"5","author":"Toft B.","year":"1970","journal-title":"Studia Sci. Math. Hungar."},{"key":"e_1_2_1_22_2","first-page":"461","article-title":"A note on chromatic number of direct product of graphs","volume":"24","author":"Turzik D.","year":"1983","journal-title":"Comment Math. Univ. Carolinae"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1962-0133816-6"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90056-X"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190090409","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190090409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T23:23:54Z","timestamp":1697757834000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190090409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["10.1002\/jgt.3190090409"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190090409","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}