{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:38:36Z","timestamp":1770323916506,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,6,26]],"date-time":"2012-06-26T00:00:00Z","timestamp":1340668800000},"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":[[2013,5]]},"DOI":"10.1007\/s10878-012-9513-8","type":"journal-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T06:11:17Z","timestamp":1340777477000},"page":"752-765","source":"Crossref","is-referenced-by-count":11,"title":["The game Grundy number of graphs"],"prefix":"10.1007","volume":"25","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Havet","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":[[2012,6,26]]},"reference":[{"issue":"9","key":"9513_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":"9513_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"},{"issue":"1","key":"9513_CR3","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 HA (2004a) A simple competitive graph coloring algorithm. II. J Comb Theory, Ser B 90(1):93\u2013106 (dedicated to Adrian Bondy and USR Murty)","journal-title":"J Comb Theory, Ser B"},{"issue":"1","key":"9513_CR4","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 HA (2004b) A simple competitive graph coloring algorithm. III. J Comb Theory, Ser\u00a0B 92(1):137\u2013150","journal-title":"J Comb Theory, Ser\u00a0B"},{"key":"9513_CR5","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":"9513_CR6","doi-asserted-by":"crossref","unstructured":"Gardner M (1981) Mathematical games. Sci Am April","DOI":"10.1038\/scientificamerican0281-17"},{"issue":"1","key":"9513_CR7","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":"DJ Guan","year":"1999","unstructured":"Guan DJ, Zhu X (1999) Game chromatic number of outerplanar graphs. J Graph Theory 30(1):67\u201370","journal-title":"J Graph Theory"},{"issue":"4","key":"9513_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/jgt.10069","volume":"41","author":"W He","year":"2002","unstructured":"He W, Hou X, Lih K-W, Shao J, Wang W, Zhu X (2002) Edge-partitions of planar graphs and their game coloring numbers. J Graph Theory 41(4):307\u2013317","journal-title":"J Graph Theory"},{"issue":"1","key":"9513_CR9","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":"9513_CR10","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":"9513_CR11","volume":"8","author":"HA Kierstead","year":"2001","unstructured":"Kierstead HA, Trotter WT (2001) Competitive colorings of oriented graphs. Electron J Comb 8(2):12 (research paper, 15 pp (electronic). In honor of Aviezri Fraenkel on the occasion of his 70th birthday)","journal-title":"Electron J Comb"},{"issue":"1","key":"9513_CR12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00373-002-0489-5","volume":"19","author":"HA Kierstead","year":"2003","unstructured":"Kierstead HA, Tuza Zs (2003) Marking games and the oriented game chromatic number of partial k-trees. Graphs Comb 19(1):121\u2013129","journal-title":"Graphs Comb"},{"issue":"3","key":"9513_CR13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/B:ORDE.0000026489.93166.cb","volume":"20","author":"HA Kierstead","year":"2004","unstructured":"Kierstead HA, Yang D (2004) Orderings on graphs and game coloring number. Order 20(3):255\u2013264. 2003","journal-title":"Order"},{"issue":"2","key":"9513_CR14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s11083-005-9012-y","volume":"22","author":"HA Kierstead","year":"2005","unstructured":"Kierstead HA, Yang D (2005) Very asymmetric marking games. Order 22(2):93\u2013107","journal-title":"Order"},{"issue":"2","key":"9513_CR15","volume":"8","author":"J Ne\u0161et\u0159il","year":"2001","unstructured":"Ne\u0161et\u0159il J, Sopena E (2001) On the oriented game chromatic number. Electron J Comb 8(2):14 (research paper, 13 pp (electronic). In honor of Aviezri Fraenkel on the occasion of his 70th birthday)","journal-title":"Electron J Comb"},{"issue":"12","key":"9513_CR16","doi-asserted-by":"crossref","first-page":"2637","DOI":"10.1016\/j.disc.2007.05.023","volume":"308","author":"J Wu","year":"2008","unstructured":"Wu J, Zhu X (2008) Lower bounds for the game colouring number of partial k-trees and planar graphs. Discrete Math 308(12):2637\u20132642","journal-title":"Discrete Math"},{"issue":"1\u20133","key":"9513_CR17","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 (2000) The game coloring number of pseudo partial k-trees. Discrete Math 215(1\u20133):245\u2013262","journal-title":"Discrete Math"},{"key":"9513_CR18","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/jgt.20338","volume":"59","author":"X Zhu","year":"2008","unstructured":"Zhu X (2008a) The game coloring number of planar graphs. J Graph Theory 59:261\u2013278","journal-title":"J Graph Theory"},{"issue":"1","key":"9513_CR19","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 (2008b) Refined activation strategy for the marking game. J Comb Theory, Ser B 98(1):1\u201318","journal-title":"J Comb Theory, Ser B"},{"issue":"4","key":"9513_CR20","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/jgt.20338","volume":"59","author":"X Zhu","year":"2008","unstructured":"Zhu X (2008c) Game coloring the Cartesian product of graphs. J Graph Theory 59(4):261\u2013278","journal-title":"J Graph Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9513-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9513-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9513-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T08:48:24Z","timestamp":1561884504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9513-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,26]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9513"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9513-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,26]]}}}