{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:44:46Z","timestamp":1648957486875},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,11,13]],"date-time":"2014-11-13T00:00:00Z","timestamp":1415836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s11083-014-9336-6","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T20:41:32Z","timestamp":1415997692000},"page":"347-361","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Relaxed Edge-Coloring Game and k-Degenerate Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Charles","family":"Dunn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Morawski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer Firkins","family":"Nordstrom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"issue":"9","key":"9336_CR1","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1016\/j.dam.2005.05.031","volume":"154","author":"SD Andres","year":"2006","unstructured":"Andres, S.D.: The game chromatic index of forests of maximum degree \u0394\u22655. Discret. Appl. Math. 154(9), 1317\u20131323 (2006)","journal-title":"Discret. Appl. Math."},{"key":"9336_CR2","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.: On the complexity of some coloring games, Graph Theoretical Concepts in Computer Science. In: M\u00f6hring, R. (ed.) Lecture notes in Computer Science, vol. 484, pp 30\u201340. Springer-Verlag (1991)","DOI":"10.1007\/3-540-53832-1_29"},{"issue":"3","key":"9336_CR3","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1002\/1097-0118(200103)36:3<144::AID-JGT1002>3.0.CO;2-F","volume":"36","author":"L Cai","year":"2001","unstructured":"Cai, L., Zhu, X.: Game chromatic index of k-degenerate graphs. J. Graph Theory 36(3), 144\u2013155 (2001)","journal-title":"J. Graph Theory"},{"issue":"1-3","key":"9336_CR4","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. Discret. Math. 262(1-3), 89\u201398 (2003)","journal-title":"Discret. Math."},{"key":"9336_CR5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"L Cowen","year":"1986","unstructured":"Cowen, L., Cowen, R., Woodall, D.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10, 187\u2013195 (1986)","journal-title":"J. Graph Theory"},{"key":"9336_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T","volume":"24","author":"L Cowen","year":"1997","unstructured":"Cowen, L., Goddard, W., Jesurum, C.: Defective coloring revisited. J. Graph Theory 24, 205\u2013220 (1997)","journal-title":"J. Graph Theory"},{"key":"9336_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s003730050020","volume":"14","author":"W Deuber","year":"1998","unstructured":"Deuber, W., Zhu, X.: Relaxed coloring of a graph. Graphs Combin. 14, 121\u2013130 (1998)","journal-title":"Graphs Combin."},{"key":"9336_CR8","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. Discret. Math. 196, 109\u2013115 (1999)","journal-title":"Discret. Math."},{"issue":"3","key":"9336_CR9","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s11083-011-9217-1","volume":"29","author":"C Dunn","year":"2012","unstructured":"Dunn, C.: Complete multipartite graphs and the relaxed coloring game. Order 29(3), 507\u2013512 (2012)","journal-title":"Order"},{"key":"9336_CR10","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1016\/j.disc.2006.09.025","volume":"307","author":"C Dunn","year":"2007","unstructured":"Dunn, C.: The relaxed game chromatic index of k-degenerate graphs. Discret. Math. 307, 1767\u20131775 (2007)","journal-title":"Discret. Math."},{"key":"9336_CR11","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 Series B 90, 93\u2013106 (2004)","journal-title":"J. Comb. Theory Series B"},{"key":"9336_CR12","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 Series B 92, 137\u2013150 (2004)","journal-title":"J. Comb. Theory, Series B"},{"key":"9336_CR13","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":"9336_CR14","first-page":"79","volume":"25","author":"N Eaton","year":"1999","unstructured":"Eaton, N., Hull, T.: Defective list colorings of planar graphs. Bull. Inst. Combin. Appl. 25, 79\u201387 (1999)","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"3","key":"9336_CR15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.tcs.2002.10.002","volume":"313","author":"P Erdo\u030bs","year":"2004","unstructured":"Erdo\u030bs, P., Faigle, U., Hochst\u00e4ttler, W., Kern, W.: Note on the game chromatic index of trees. Theor. Comput. Sci. 313(3), 371\u2013376 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"9336_CR16","first-page":"143","volume":"35","author":"U Faigle","year":"1993","unstructured":"Faigle, U., Kern, W., Kierstead, H.A., Trotter, W.: On the game chromatic number of some classes of graphs. Ars Comb. 35, 143\u2013150 (1993)","journal-title":"Ars Comb."},{"key":"9336_CR17","doi-asserted-by":"crossref","unstructured":"Gardner, M.: Mathematical Games. Sci. Am., 23 (1981)","DOI":"10.1038\/scientificamerican1081-23"},{"key":"9336_CR18","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/(SICI)1097-0118(199901)30:1<67::AID-JGT7>3.0.CO;2-M","volume":"30","author":"D Guan","year":"1999","unstructured":"Guan, D., Zhu, X.: Game chromatic number of outerplanar graphs. J. Graph Theory 30, 67\u201370 (1999)","journal-title":"J. Graph Theory"},{"issue":"1-3","key":"9336_CR19","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. Discret. Math. 281(1-3), 209\u2013219 (2004)","journal-title":"Discret. Math."},{"key":"9336_CR20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/jctb.1999.1927","volume":"78","author":"HA Kierstead","year":"2000","unstructured":"Kierstead, H.A.: A simple competitive graph coloring algorithm. J. Comb. Theory, Series B 78, 57\u201368 (2000)","journal-title":"J. Comb. Theory, Series B"},{"key":"9336_CR21","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1002\/jgt.3190180605","volume":"18","author":"HA Kierstead","year":"1994","unstructured":"Kierstead, H.A., Trotter, W.: Planar graph coloring with an uncooperative partner. J. Graph Theory 18, 569\u2013584 (1994)","journal-title":"J. Graph Theory"},{"issue":"1","key":"9336_CR22","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00373-002-0489-5","volume":"19","author":"HA Kierstead","year":"2003","unstructured":"Kierstead, H.A., Tuza, Zs.: Marking games and the oriented game chromatic number of partial k-trees. Graphs Combin. 19(1), 121\u2013129 (2003)","journal-title":"Graphs Combin."},{"key":"9336_CR23","unstructured":"Lam, P., Shiu, W., Xu, B.: Edge game-coloring of graphs. Graph Theory Notes of New York XXXVII, 17\u201319 (1999)"},{"key":"9336_CR24","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1017\/S0963548399003752","volume":"8","author":"R \u0160krekovski","year":"1999","unstructured":"\u0160krekovski, R.: List impoper colourings of planar graphs. Combin. Probab. Comput. 8, 293\u2013299 (1999)","journal-title":"Combin. Probab. Comput."},{"key":"9336_CR25","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1006\/jctb.1998.1878","volume":"75","author":"X Zhu","year":"1999","unstructured":"Zhu, X.: Game coloring of planar graphs. J. Comb. Theory, Series B 75, 245\u2013258 (1999)","journal-title":"J. Comb. Theory, Series B"},{"key":"9336_CR26","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(99)00237-X","volume":"215","author":"X Zhu","year":"2000","unstructured":"Zhu, X.: The game coloring number of pseudo partial k-trees. Discret. Math. 215, 245\u2013262 (2000)","journal-title":"Discret. Math."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-014-9336-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-014-9336-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-014-9336-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:12:16Z","timestamp":1559365936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-014-9336-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,13]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9336"],"URL":"https:\/\/doi.org\/10.1007\/s11083-014-9336-6","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,13]]}}}