{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:20:03Z","timestamp":1758846003793,"version":"3.44.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3485,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0095-8956(03)00077-7","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T11:52:27Z","timestamp":1062589947000},"page":"93-106","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"title":["A simple competitive graph coloring algorithm II"],"prefix":"10.1016","volume":"90","author":[{"given":"Charles","family":"Lundon","sequence":"first","affiliation":[]},{"given":"H.A.","family":"Kierstead","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(03)00077-7_BIB1","series-title":"Graph Theoretical concepts in Computer Science","first-page":"30","article-title":"On the complexity of some coloring games","volume":"Vol. 484","author":"Bodlaender","year":"1991"},{"key":"10.1016\/S0095-8956(03)00077-7_BIB2","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1002\/1097-0118(200103)36:3<144::AID-JGT1002>3.0.CO;2-F","article-title":"Game chromatic index of k-degenerate graphs","volume":"36","author":"Cai","year":"2001","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(03)00077-7_BIB3","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1006\/jctb.1993.1012","article-title":"Graphs with linearly bounded Ramsey numbers","volume":"57","author":"Chen","year":"1993","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(03)00077-7_BIB4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0012-365X(02)00521-6","article-title":"Relaxed game chromatic number of graphs","volume":"262","author":"Chou","year":"2003","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(03)00077-7_BIB5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/jgt.3190100207","article-title":"Defective colorings of graphs in surfaces","volume":"10","author":"Cowen","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(03)00077-7_BIB6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T","article-title":"Defective coloring revisited","volume":"24","author":"Cowen","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(03)00077-7_BIB7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s003730050020","article-title":"Relaxed coloring of a graph","volume":"14","author":"Deuber","year":"1998","journal-title":"Graphs Combin."},{"key":"10.1016\/S0095-8956(03)00077-7_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0012-365X(98)00197-6","article-title":"A bound for the game chromatic number of graphs","volume":"196","author":"Dinski","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(03)00077-7_BIB9","unstructured":"C. Lundon, H. Kierstead, A simple competitive graph coloring algorithm III, manuscript, 2002."},{"key":"10.1016\/S0095-8956(03)00077-7_BIB10","first-page":"79","article-title":"Defective list colorings of planar graphs","volume":"25","author":"Eaton","year":"1999","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/S0095-8956(03)00077-7_BIB11","first-page":"143","article-title":"On the game chromatic number of some classes of graphs","volume":"35","author":"Faigle","year":"1993","journal-title":"Ars Combin."},{"key":"10.1016\/S0095-8956(03)00077-7_BIB12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/(SICI)1097-0118(199901)30:1<67::AID-JGT7>3.0.CO;2-M","article-title":"Game chromatic number of outerplanar graphs","volume":"30","author":"Guan","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(03)00077-7_BIB13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/jctb.1999.1927","article-title":"A simple competitive graph coloring algorithm","volume":"78","author":"Kierstead","year":"2000","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(03)00077-7_BIB14","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1002\/jgt.3190180605","article-title":"Planar graph coloring with an uncooperative partner","volume":"18","author":"Kierstead","year":"1994","journal-title":"J. Graph Theory"},{"issue":"12","key":"10.1016\/S0095-8956(03)00077-7_BIB15","first-page":"15","article-title":"Competitive colorings of oriented graphs","volume":"8","author":"Kierstead","year":"2001","journal-title":"Electron. J. Combin."},{"key":"10.1016\/S0095-8956(03)00077-7_BIB16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00373-002-0489-5","article-title":"Marking games and the oriented game chromatic number of partial k-trees","volume":"19","author":"Kierstead","year":"2003","journal-title":"Graphs Combin."},{"issue":"14","key":"10.1016\/S0095-8956(03)00077-7_BIB17","first-page":"13","article-title":"On the oriented game chromatic number","volume":"8","author":"Ne\u0161et\u0159il","year":"2001","journal-title":"Electron. J. Combin."},{"key":"10.1016\/S0095-8956(03)00077-7_BIB18","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1017\/S0963548399003752","article-title":"List improper colourings of planar graphs","volume":"8","author":"\u0160krekovski","year":"1999","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0095-8956(03)00077-7_BIB19","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1006\/jctb.1998.1878","article-title":"Game coloring number of planar graphs","volume":"75","author":"Zhu","year":"1999","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(03)00077-7_BIB20","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(99)00237-X","article-title":"The game coloring number of pseudo partial k-trees","volume":"215","author":"Zhu","year":"2000","journal-title":"Discrete Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000777?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000777?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:00:53Z","timestamp":1758816053000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895603000777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0095895603000777"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(03)00077-7","relation":{},"ISSN":["0095-8956"],"issn-type":[{"type":"print","value":"0095-8956"}],"subject":[],"published":{"date-parts":[[2004,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A simple competitive graph coloring algorithm II","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0095-8956(03)00077-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}