{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:23:20Z","timestamp":1725758600634},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452772"},{"type":"electronic","value":"9783642452789"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45278-9_10","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T15:35:18Z","timestamp":1385393718000},"page":"106-114","source":"Crossref","is-referenced-by-count":2,"title":["Incidence Coloring Game and Arboricity of Graphs"],"prefix":"10.1007","author":[{"given":"Cl\u00e9ment","family":"Charpentier","sequence":"first","affiliation":[]},{"given":"\u00c9ric","family":"Sopena","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"1980","DOI":"10.1016\/j.dam.2007.10.021","volume":"157","author":"S. Andres","year":"2009","unstructured":"Andres, S.: The incidence game chromatic number. Discrete Appl. Math.\u00a0157, 1980\u20131987 (2009)","journal-title":"Discrete Appl. Math."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bartnicki, T., Grytczuk, J., Kierstead, H.A., Zhu, X.: The map coloring game. Amer. Math. Monthly (November 2007)","DOI":"10.1080\/00029890.2007.11920471"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1142\/S0129054191000091","volume":"2","author":"H. Bodlaender","year":"1991","unstructured":"Bodlaender, H.: On the complexity of some coloring games. Int. J. Found. Comput. Sci.\u00a02, 133\u2013147 (1991)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0012-365X(93)90286-3","volume":"122","author":"R. Brualdi","year":"1993","unstructured":"Brualdi, R., Massey, J.: Incidence and strong edge colorings of graphs. Discrete Math.\u00a0122, 51\u201358 (1993)","journal-title":"Discrete Math."},{"key":"10_CR5","unstructured":"Charpentier, C., Sopena, E.: The incidence game chromatic number of forests (preprint, 2013)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0012-365X(98)00197-6","volume":"196","author":"T. Dinski","year":"1999","unstructured":"Dinski, T., Zhu, X.: Game chromatic number of graphs. Discrete Math.\u00a0196, 109\u2013115 (1999)","journal-title":"Discrete Math."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Gardner, M.: Mathematical game. Scientific American\u00a023 (1981)","DOI":"10.1038\/scientificamerican1081-23"},{"issue":"1","key":"10_CR8","first-page":"203","volume":"7","author":"M. Hosseini Dolama","year":"2005","unstructured":"Hosseini Dolama, M., Sopena, E.: On the maximum average degree and the incidence chromatic number of a graph. Discrete Math. and Theoret. Comput. Sci.\u00a07(1), 203\u2013216 (2005)","journal-title":"Discrete Math. and Theoret. Comput. Sci."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.disc.2004.01.015","volume":"283","author":"M. Hosseini Dolama","year":"2004","unstructured":"Hosseini Dolama, M., Sopena, E., Zhu, X.: Incidence coloring of k-degenerated graphs. Discrete Math.\u00a0283, 121\u2013128 (2004)","journal-title":"Discrete Math."},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","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. Combin. Theory Ser. B\u00a078(1), 57\u201368 (2000)","journal-title":"J. Combin. Theory Ser. B"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1002\/jgt.3190180605","volume":"18","author":"H. Kierstead","year":"1994","unstructured":"Kierstead, H., Trotter, W.: Planar graph coloring with an uncooperative partner. J. Graph Theory\u00a018, 569\u2013584 (1994)","journal-title":"J. Graph Theory"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.dam.2010.01.001","volume":"159","author":"J. Kim","year":"2011","unstructured":"Kim, J.: The incidence game chromatic number of paths and subgraphs of wheels. Discrete Appl. Math.\u00a0159, 683\u2013694 (2011)","journal-title":"Discrete Appl. Math."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.disc.2005.02.003","volume":"292","author":"M. Maydansky","year":"2005","unstructured":"Maydansky, M.: The incidence coloring conjecture for graphs of maximum degree three. Discrete Math.\u00a0292, 131\u2013141 (2005)","journal-title":"Discrete Math."},{"key":"10_CR14","unstructured":"Sopena, E.: \n                    \n                      http:\/\/www.labri.fr\/perso\/sopena\/TheIncidenceColoringPage"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0012-365X(01)00302-8","volume":"256","author":"S. Wang","year":"2002","unstructured":"Wang, S., Chen, D., Pang, S.: The incidence coloring number of Halin graphs and outerplanar graphs. Discrete Math.\u00a0256, 397\u2013405 (2002)","journal-title":"Discrete Math."},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1006\/jctb.1998.1878","volume":"75","author":"X. Zhu","year":"1999","unstructured":"Zhu, X.: The game coloring number of planar graphs. J. Combin. Theory Ser. B\u00a075(2), 245\u2013258 (1999)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2007.04.004","volume":"98","author":"X. Zhu","year":"2008","unstructured":"Zhu, X.: Refined activation strategy for the marking game. J. Combin. Theory Ser. B\u00a098(1), 1\u201318 (2008)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45278-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T19:07:26Z","timestamp":1558724846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45278-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452772","9783642452789"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45278-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}