{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T17:17:13Z","timestamp":1782235033179,"version":"3.54.5"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,5,18]],"date-time":"2011-05-18T00:00:00Z","timestamp":1305676800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s11083-011-9217-1","type":"journal-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T06:57:36Z","timestamp":1305615456000},"page":"507-512","source":"Crossref","is-referenced-by-count":4,"title":["Complete Multipartite Graphs and the Relaxed Coloring Game"],"prefix":"10.1007","volume":"29","author":[{"given":"Charles","family":"Dunn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,5,18]]},"reference":[{"issue":"9","key":"9217_CR1","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1080\/00029890.2007.11920471","volume":"114","author":"T Bartnicki","year":"2007","unstructured":"Bartnicki, T., Grytczuk, J., Kierstead, H.A., Zhu, X.: The map-coloring game. Am. Math. Mon. 114(9), 783\u2013803 (2007)","journal-title":"Am. Math. Mon."},{"key":"9217_CR2","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-53832-1_29","volume-title":"Graph Theoretical Concepts in Computer Science, Lecture notes in Computer Science","author":"H Bodlaender","year":"1991","unstructured":"Bodlaender, H.: On the complexity of some coloring games. In: M\u00f6hring, R. (ed.) Graph Theoretical Concepts in Computer Science, Lecture notes in Computer Science, vol.\u00a0484, pp. 30\u201340. Springer, Berlin (1991)"},{"issue":"1\u20133","key":"9217_CR3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0012-365X(02)00521-6","volume":"262","author":"C Chou","year":"2003","unstructured":"Chou, C., Wang, W., Zhu, X.: Relaxed game chromatic number of graphs. Discrete Math. 262(1\u20133), 89\u201398 (2003)","journal-title":"Discrete Math."},{"key":"9217_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0012-365X(98)00197-6","volume":"196","author":"T Dinski","year":"1999","unstructured":"Dinski, T., Zhu, X.: A bound for the game chromatic number of graphs. Discrete Math. 196, 109\u2013115 (1999)","journal-title":"Discrete Math."},{"key":"9217_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0095-8956(03)00077-7","volume":"90","author":"C Dunn","year":"2004","unstructured":"Dunn, C., Kierstead, H.A.: A simple competitive graph coloring algorithm II. J. Comb. Theory, Ser. B 90, 93\u2013106 (2004)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9217_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.jctb.2004.03.010","volume":"92","author":"C Dunn","year":"2004","unstructured":"Dunn, C., Kierstead, H.A.: A simple competitive graph coloring algorithm III. J. Comb. Theory, Ser. B 92, 137\u2013150 (2004)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9217_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/jgt.10172","volume":"46","author":"C Dunn","year":"2004","unstructured":"Dunn, C., Kierstead, H.A.: The relaxed game chromatic number of outerplanar graphs. J. Graph Theory 46, 69\u201378 (2004)","journal-title":"J. Graph Theory"},{"key":"9217_CR8","first-page":"143","volume":"35","author":"U Faigle","year":"1993","unstructured":"Faigle, U., Kern, W., Kierstead, H., Trotter, W.: On the game chromatic number of some classes of graphs. Ars Comb. 35, 143\u2013150 (1993)","journal-title":"Ars Comb."},{"issue":"1\u20133","key":"9217_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.disc.2003.08.006","volume":"281","author":"W He","year":"2004","unstructured":"He, W., Wu, J., Zhu, X.: Relaxed game chromatic number of trees and outerplanar graphs. Discrete Math. 281(1\u20133), 209\u2013219 (2004)","journal-title":"Discrete Math."},{"key":"9217_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/jctb.1999.1927","volume":"78","author":"H Kierstead","year":"2000","unstructured":"Kierstead, H.: A simple competitive graph coloring algorithm. J. Comb. Theory, Ser. B 78, 57\u201368 (2000)","journal-title":"J. Comb. Theory, Ser. B"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-011-9217-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-011-9217-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-011-9217-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T20:41:51Z","timestamp":1560199311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-011-9217-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,18]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["9217"],"URL":"https:\/\/doi.org\/10.1007\/s11083-011-9217-1","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,18]]}}}