{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:15:19Z","timestamp":1649034919638},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9657-1","type":"journal-article","created":{"date-parts":[[2013,8,31]],"date-time":"2013-08-31T08:57:51Z","timestamp":1377939471000},"page":"596-611","source":"Crossref","is-referenced-by-count":0,"title":["The game Grundy indices of graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Wenchao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,1]]},"reference":[{"issue":"9","key":"9657_CR1","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1080\/00029890.2007.11920471","volume":"114","author":"T Bartnicki","year":"2007","unstructured":"Bartnicki T, Grytczuk J, Kierstead HA, Zhu X (2007) The map colouring game. Am Math Mon 114(9):793\u2013803","journal-title":"Am Math Mon"},{"issue":"2","key":"9657_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1142\/S0129054191000091","volume":"2","author":"HL Bodlaender","year":"1991","unstructured":"Bodlaender HL (1991) On the complexity of some coloring games. Int J Found Comput Sci 2(2):133\u2013147","journal-title":"Int J Found Comput Sci"},{"key":"9657_CR3","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 (1999) A bound for the game chromatic number of graphs. Discret Math 196:109\u2013115","journal-title":"Discret Math"},{"key":"9657_CR4","first-page":"143","volume":"35","author":"U Faigle","year":"1993","unstructured":"Faigle U, Kern U, Kierstead HA, Trotter WT (1993) On the game chromatic number of some classes of graphs. Ars Comb 35:143\u2013150","journal-title":"Ars Comb"},{"key":"9657_CR5","doi-asserted-by":"crossref","unstructured":"Gardner M (1981) Mathematical games. Scientific American.","DOI":"10.1038\/scientificamerican1281-18"},{"key":"9657_CR6","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1007\/s10878-012-9513-8","volume":"25","author":"F Havet","year":"2013","unstructured":"Havet F, Zhu X (2013) The game Grundy number of graphs. J Comb Optim 25:752\u2013765","journal-title":"J Comb Optim"},{"issue":"1","key":"9657_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/jctb.1999.1927","volume":"78","author":"HA Kierstead","year":"2000","unstructured":"Kierstead HA (2000) A simple competitive graph coloring algorithm. J Comb Theory Ser B 78(1):57\u201368","journal-title":"J Comb Theory Ser B"},{"issue":"6","key":"9657_CR8","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1002\/jgt.3190180605","volume":"18","author":"HA Kierstead","year":"1994","unstructured":"Kierstead HA, Trotter WT (1994) Planar graph coloring with an uncooperative partner. J Graph Theory 18(6):569\u2013584","journal-title":"J Graph Theory"},{"issue":"2","key":"9657_CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1006\/jctb.1998.1878","volume":"75","author":"X Zhu","year":"1999","unstructured":"Zhu X (1999) The game coloring number of planar graphs. J Comb Theory Ser B 75(2):245\u2013258","journal-title":"J Comb Theory Ser B"},{"issue":"1","key":"9657_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2007.04.004","volume":"98","author":"X Zhu","year":"2008","unstructured":"Zhu X (2008) Refined activation strategy for the marking game. J Comb Theory Ser B 98(1):1\u201318","journal-title":"J Comb Theory Ser B"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9657-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9657-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9657-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T22:30:47Z","timestamp":1563834647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9657-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,1]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9657"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9657-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,1]]}}}