{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T07:13:15Z","timestamp":1726384395388},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T00:00:00Z","timestamp":1566604800000},"content-version":"vor","delay-in-days":23,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1016\/j.entcs.2019.08.030","type":"journal-article","created":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T12:46:31Z","timestamp":1569847591000},"page":"333-344","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["PSPACE-hardness of Two Graph Coloring Games"],"prefix":"10.1016","volume":"346","author":[{"given":"Eurinardo","family":"Costa","sequence":"first","affiliation":[]},{"given":"Victor Lage","family":"Pessoa","sequence":"additional","affiliation":[]},{"given":"Rudini","family":"Sampaio","sequence":"additional","affiliation":[]},{"given":"Ronan","family":"Soares","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2019.08.030_br0010","doi-asserted-by":"crossref","first-page":"2514","DOI":"10.1016\/j.dam.2011.08.016","article-title":"On the grundy number of graphs with few P4's","volume":"160","author":"Ara\u00fajo","year":"2012","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.entcs.2019.08.030_br0020","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1142\/S0129054191000091","article-title":"On the complexity of some coloring games","volume":"2","author":"Bodlaender","year":"1991","journal-title":"Int J Found Comput Sci"},{"key":"10.1016\/j.entcs.2019.08.030_br0030","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/rsa.20179","article-title":"The game chromatic number of random graphs","volume":"32","author":"Bohman","year":"2008","journal-title":"Random Structures & Algorithms"},{"key":"10.1016\/j.entcs.2019.08.030_br0040","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1016\/j.ipl.2012.07.011","article-title":"Partitioning extended P4-laden graphs into cliques and stable sets","volume":"112","author":"Bravo","year":"2012","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.entcs.2019.08.030_br0050","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.entcs.2019.08.030_br0060","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0012-365X(98)00197-6","article-title":"A bound for the game chromatic number of graphs","volume":"196","author":"Dinski","year":"1999","journal-title":"Discrete Mathematics"},{"issue":"2","key":"10.1016\/j.entcs.2019.08.030_br0070","article-title":"The game chromatic number of trees and forests","volume":"17","author":"Dunn","year":"2015","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2019.08.030_br0080","first-page":"143","article-title":"On the game chromatic number of some classes of graphs","volume":"35","author":"Faigle","year":"1993","journal-title":"Ars Combinatoria"},{"key":"10.1016\/j.entcs.2019.08.030_br0090","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1038\/scientificamerican0481-18","article-title":"Mathematical games","volume":"244","author":"Gardner","year":"1981","journal-title":"Scientific American"},{"key":"10.1016\/j.entcs.2019.08.030_br0100","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0020-0190(96)00134-2","article-title":"P4-laden graphs: A new class of brittle graphs","volume":"60","author":"Giakoumakis","year":"1996","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.entcs.2019.08.030_br0110","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1007\/s10878-012-9513-8","article-title":"The game grundy number of graphs","volume":"25","author":"Havet","year":"2013","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.entcs.2019.08.030_br0120","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","article-title":"A tree representation for P4-sparse graphs","volume":"35","author":"Jamison","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.entcs.2019.08.030_br0130","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":"Journal of Graph Theory"},{"key":"10.1016\/j.entcs.2019.08.030_br0140","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/j.endm.2015.06.108","article-title":"Asymmetric coloring games on incomparability graphs","volume":"49","author":"Krawczyk","year":"2015","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10.1016\/j.entcs.2019.08.030_br0150","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s00373-018-1877-9","article-title":"The game coloring number of planar graphs with a specific girth","volume":"34","author":"Nakprasit","year":"2018","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/j.entcs.2019.08.030_br0160","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","article-title":"On the complexity of some two-person perfect-information games","volume":"16","author":"Schaefer","year":"1978","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.entcs.2019.08.030_br0170","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.disc.2014.04.011","article-title":"The game coloring number of planar graphs with a given girth","volume":"330","author":"Sekiguchi","year":"2014","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.entcs.2019.08.030_br0180","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.ipl.2006.12.003","article-title":"The game chromatic number and the game colouring number of cactuses","volume":"102","author":"Sidorowicz","year":"2007","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.entcs.2019.08.030_br0190","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1006\/jctb.1998.1878","article-title":"The game coloring number of planar graphs","volume":"75","author":"Zhu","year":"1999","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.entcs.2019.08.030_br0200","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(99)00237-X","article-title":"The game coloring number of pseudo partial k-trees","volume":"215","author":"Zhu","year":"2000","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.entcs.2019.08.030_br0210","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2007.04.004","article-title":"Refined activation strategy for the marking game","volume":"98","author":"Zhu","year":"2008","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066119300805?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066119300805?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T12:46:41Z","timestamp":1569847601000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066119300805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":21,"alternative-id":["S1571066119300805"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2019.08.030","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}