{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T21:19:06Z","timestamp":1770326346936,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T00:00:00Z","timestamp":1519257600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Commission on Higher Education and the Thailand Research Fund","award":["RSA5780014"],"award-info":[{"award-number":["RSA5780014"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s00373-018-1877-9","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T18:25:11Z","timestamp":1519410311000},"page":"349-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Game Coloring Number of Planar Graphs with a Specific Girth"],"prefix":"10.1007","volume":"34","author":[{"given":"Keaitsuda Maneeruk","family":"Nakprasit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kittikorn","family":"Nakprasit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,22]]},"reference":[{"key":"1877_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1142\/S0129054191000091","volume":"2","author":"HL Bodlaender","year":"1991","unstructured":"Bodlaender, H.L.: On the complexity of some colouring games. J. Found. Comput. Sci. 2, 133\u2013147 (1991)","journal-title":"J. Found. Comput. Sci."},{"key":"1877_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.7151\/dmgt.1434","volume":"29","author":"OV Borodin","year":"2009","unstructured":"Borodin, O.V., Ivanova, A.O., Kostochka, A.V., Sheikh, N.N.: Decomposing of quadrangle-free planar graphs. Discuss. Math. Graph Theory 29, 87\u201399 (2009)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1877_CR3","first-page":"143","volume":"35","author":"U Faigle","year":"1993","unstructured":"Faigle, U., Kern, U., Kierstead, H.A., Trotter, W.T.: The game chromatic number of some classes of graphs graphs. Ars Comb. 35, 143\u2013150 (1993)","journal-title":"Ars Comb."},{"key":"1877_CR4","doi-asserted-by":"publisher","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.: The game chromatic number of outerplanar graphs. J. Graph Theory 30, 67\u201370 (1999)","journal-title":"J. Graph Theory"},{"key":"1877_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/jgt.10069","volume":"41","author":"W He","year":"2002","unstructured":"He, W., Hou, X., Lih, K., Shao, J., Wang, W., Zhu, X.: Edge-partitions of planar graphs and their game coloring numbers. J. Graph Theory 41, 307\u2013317 (2002)","journal-title":"J. Graph Theory"},{"key":"1877_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/jctb.1999.1927","volume":"78","author":"HA Kierstead","year":"2000","unstructured":"Kierstead, H.A.: A simple competitive graph colouring algorithm. J. Comb. Theory Ser. B 78, 57\u201368 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1877_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s11083-005-9012-y","volume":"22","author":"HA Kierstead","year":"2005","unstructured":"Kierstead, H.A., Yang, D.: Very asymmetric marking games. Order 22, 93\u2013107 (2005)","journal-title":"Order"},{"key":"1877_CR8","unstructured":"Kleitman, D.: Partitioning the edges of girth 6 planar graph into those of a forest and those of a set of disjoint paths and cycles, manuscript (2006)"},{"key":"1877_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2014.04.011","volume":"330","author":"Y Sekiguchi","year":"2014","unstructured":"Sekiguchi, Y.: The game coloring number of planar graphs with a given girth. Discrete Math. 330, 11\u201316 (2014)","journal-title":"Discrete Math."},{"key":"1877_CR10","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1016\/j.disc.2011.01.019","volume":"311","author":"Y Wang","year":"2011","unstructured":"Wang, Y., Zhang, Q.: Decomposing a planar graph with girth at least 8 into a forest and a matching. Discrete Math. 311, 844\u2013849 (2011)","journal-title":"Discrete Math."},{"key":"1877_CR11","unstructured":"West, D.B.: Introduction to Graph Theory, second edn. Prentice-Hall, Inc., New Jersey, USA"},{"key":"1877_CR12","doi-asserted-by":"publisher","first-page":"2637","DOI":"10.1016\/j.disc.2007.05.023","volume":"308","author":"J Wu","year":"2008","unstructured":"Wu, J., Zhu, X.: Lower bounds for the game colouring number of partial $k$-trees and planar graphs. Discrete Math. 308, 2637\u20132642 (2008)","journal-title":"Discrete Math."},{"key":"1877_CR13","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 colouring number of planar graphs. J. Comb. Theory Ser. B 75, 245\u2013258 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1877_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0012-365X(99)00237-X","volume":"215","author":"X Zhu","year":"2000","unstructured":"Zhu, X.: Game colouring number of pseudo partial $k$-trees and planar graphs. Discrete Math. 215, 245\u2013262 (2000)","journal-title":"Discrete Math."},{"key":"1877_CR15","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. Comb. Theory Ser. B 98, 1\u201318 (2008)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1877-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1877-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1877-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T00:42:03Z","timestamp":1550796123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1877-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,22]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["1877"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1877-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,22]]},"assertion":[{"value":"12 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}