{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T14:47:23Z","timestamp":1767192443081},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0012-365x(03)00247-4","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T03:43:33Z","timestamp":1063338213000},"page":"81-108","source":"Crossref","is-referenced-by-count":7,"title":["Iterated colorings of graphs"],"prefix":"10.1016","volume":"278","author":[{"given":"Sandra M","family":"Hedetniemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen T","family":"Hedetniemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alice A","family":"McRae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dee","family":"Parks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00247-4_BIB1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","article-title":"Every planar map is four colorable. Part I","volume":"21","author":"Appel","year":"1977","journal-title":"Illinois J. Math."},{"key":"10.1016\/S0012-365X(03)00247-4_BIB2","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1215\/ijm\/1256049012","article-title":"Every planar map is four colorable. Part II","volume":"21","author":"Appel","year":"1977","journal-title":"Illinois J. Math."},{"key":"10.1016\/S0012-365X(03)00247-4_BIB3","unstructured":"T. Beyer, S.M. Hedetniemi, S.T. Hedetniemi, A linear algorithm for the Grundy number of a tree, Proceedings of the 13th Southeastern Conference on Combinatorics, Graph Theory and Computing, Congr. Numer. 36 (1982) 351\u2013363."},{"key":"10.1016\/S0012-365X(03)00247-4_BIB4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(79)90067-4","article-title":"Some perfect coloring properties of graphs","volume":"27","author":"Christen","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(03)00247-4_BIB5","doi-asserted-by":"crossref","first-page":"461","DOI":"10.4153\/CMB-1978-079-5","article-title":"Properties of hereditary hypergraphs and middle graphs","volume":"21","author":"Cockayne","year":"1978","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0012-365X(03)00247-4_BIB6","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0012-365X(03)00247-4_BIB7","unstructured":"N. Goyal, S. Vishwanathan, NP-completeness of undirected Grundy numbering and related problems, preprint, 1997."},{"key":"10.1016\/S0012-365X(03)00247-4_BIB8","first-page":"6","article-title":"Mathematics and games","volume":"2","author":"Grundy","year":"1939","journal-title":"Eureka"},{"key":"10.1016\/S0012-365X(03)00247-4_BIB9","unstructured":"T.W. Haynes, S.T. Hedetniemi, P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998, 446pp."},{"key":"10.1016\/S0012-365X(03)00247-4_BIB10","first-page":"49","article-title":"Greedy colorings and the Grundy chromatic number of the n-cube","volume":"26","author":"Hoffman","year":"1999","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/S0012-365X(03)00247-4_BIB11","unstructured":"G. Prins, Unpublished manuscript, February 8, 1963."},{"issue":"4","key":"10.1016\/S0012-365X(03)00247-4_BIB12","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/S0895480194275825","article-title":"Algorithms for vertex partitioning problems on partial k-trees","volume":"10","author":"Telle","year":"1997","journal-title":"SIAM J. Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002474?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002474?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T13:06:20Z","timestamp":1585141580000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0012365X03002474"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00247-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}