{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:45:37Z","timestamp":1770324337676,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5280,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0012-365x(98)00197-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:07:13Z","timestamp":1027598833000},"page":"109-115","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":65,"title":["A bound for the game chromatic number of graphs"],"prefix":"10.1016","volume":"196","author":[{"given":"Thomas","family":"Dinski","sequence":"first","affiliation":[]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00197-6_BIB1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1017\/S001708950000358X","article-title":"An acyclic analogue to Heawood's theorem","volume":"19","author":"Albertson","year":"1978","journal-title":"Glasgow Math. J."},{"key":"10.1016\/S0012-365X(98)00197-6_BIB2","series-title":"Proceedings of the WG 1990 Workshop on Graph Theoretical Concepts in Computer Science","first-page":"30","article-title":"On the complexity of some coloring games","author":"Bodlaender","year":"1990"},{"key":"10.1016\/S0012-365X(98)00197-6_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","article-title":"On acyclic colorings of planar graphs","volume":"25","author":"Borodin","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00197-6_BIB4","first-page":"143","article-title":"On the game chromatic number of some classes of graphs","volume":"35","author":"Faigle","year":"1993","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(98)00197-6_BIB5","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF02764716","article-title":"Acyclic colorings of planar graphs","volume":"14","author":"Gr\u00fcnbaum","year":"1973","journal-title":"Israel J. Math."},{"issue":"6","key":"10.1016\/S0012-365X(98)00197-6_BIB6","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1002\/jgt.3190180605","article-title":"Planar graph coloring with an uncooperative partner","volume":"18","author":"Kierstead","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00197-6_BIB7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<331::AID-JGT5>3.0.CO;2-P","article-title":"Acyclic chromatic numbers of graphs","volume":"24","author":"Kostochka","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00197-6_BIB8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/(SICI)1097-0118(199707)25:3<191::AID-JGT3>3.0.CO;2-G","article-title":"The chromatic number of oriented graphs","volume":"25","author":"Sopena","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00197-6_BIB9","unstructured":"X. Zhu, The game coloring number of planar graphs, J. Combin. Theory Ser. B, to appear."},{"key":"10.1016\/S0012-365X(98)00197-6_BIB10","series-title":"Game coloring number of pseudo partial k-trees","author":"Zhu","year":"1998"},{"key":"10.1016\/S0012-365X(98)00197-6_BIB11","unstructured":"D. Guan, X. Zhu, Game chromatic number of outerplanar graphs, J. Graph Theory, to appear."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001976?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001976?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T22:46:36Z","timestamp":1762123596000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0012365X98001976"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00197-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A bound for the game chromatic number of graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0012-365X(98)00197-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}