{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:30Z","timestamp":1720640790891},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1571-0653(04)00111-8","type":"journal-article","created":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T15:21:27Z","timestamp":1097853687000},"page":"647-652","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Chromatic numbers of the strong product of odd cycles"],"prefix":"10.1016","volume":"11","author":[{"given":"Janez","family":"Z\u0306erovnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0012-365X(92)90280-S","article-title":"Finding the prime factors of strong direct product graphs in polynomial time","volume":"109","author":"Feigenbaum","year":"1992","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB2","first-page":"155","article-title":"Analogues of the Shannon capacity of graph","volume":"12","author":"Hell","year":"1982","journal-title":"Annals Discrete Math"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB3","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of H-coloring","volume":"B 48","author":"Hell","year":"1990","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB4","series-title":"Product Graphs: Structure and Recognition","author":"Imrich","year":"2000"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB5","doi-asserted-by":"crossref","unstructured":"P.K. Jha, Smallest independent dominating sets in Kronecker products of cycles, Discrete Appl. Math., in press.","DOI":"10.1016\/S0166-218X(00)00295-X"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01855874","article-title":"Strong products of \u03c7-critical graphs","volume":"45","author":"Klav\u017ear","year":"1993","journal-title":"Aequationes Mathematicae"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(94)00377-U","article-title":"Coloring graph products - A survey","volume":"155","author":"Klav\u017ear","year":"1996","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of a graph","volume":"25","author":"Lovasz","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(89)90214-8","article-title":"A randomised 3-colouring algorithm","volume":"74","author":"Petford","year":"1989","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB10","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BF01162967","article-title":"Graph multiplication","volume":"72","author":"Sabidussi","year":"1960","journal-title":"Math.Z"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB11","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","article-title":"The zero-error capacity of a noisy channel","volume":"2","author":"Shannon","year":"1956","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0898-1221(98)00169-2","article-title":"The independence number of the strong product of cycles","volume":"36","author":"Vesel","year":"1998","journal-title":"Comput. Math. Appl"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB13","first-page":"207","article-title":"Some remarks on the chromatic number of the strong product of graphs","volume":"4","author":"Vesztergombi","year":"1978","journal-title":"Acta Cybernetica"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB14","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0012-365X(94)90402-2","article-title":"A randomized algorithm for k\u2013colorability","volume":"131","author":"\u017derovnik","year":"1994","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00111-8_NEWBIB15","unstructured":"\u017derovnik J., Pomen \u201ctemperature\u201d pri nekaterih hevristikah kombinatori\u010dne optimizacije, in Proceedings DSI, Portoro\u017e, april 2000, Slovensko Dru\u015ftvo Informatika Ljublijana 2000, pp. 604\u2013609. (In Slovene)"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T02:54:21Z","timestamp":1549162461000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304001118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":15,"alternative-id":["S1571065304001118"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00111-8","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}