乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:07:19Z","timestamp":1740114439396,"version":"3.37.3"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:00:00Z","timestamp":1720224000000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100005283","name":"FUNCAP","doi-asserted-by":"publisher","award":["4543945\/2016"],"id":[{"id":"10.13039\/501100005283","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","award":["314031\/2018-9"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","award":["401519\/2016-3","425297\/2016-0","437841\/2018-9"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"CAPES","doi-asserted-by":"publisher","award":["88887.143992\/2017-00"],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"CAPES","doi-asserted-by":"publisher","award":["88881.197438\/2018-01"],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1016\/j.tcs.2020.03.022","type":"journal-article","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T01:58:39Z","timestamp":1587088719000},"page":"36-45","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["PSPACE-completeness of two graph coloring games"],"prefix":"10.1016","volume":"824-825","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.tcs.2020.03.022_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 Appl. Math."},{"key":"10.1016\/j.tcs.2020.03.022_br0020","article-title":"Game chromatic number of cartesian product graphs","volume":"15","author":"Bartnicki","year":"2008","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.tcs.2020.03.022_br0030","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.tcs.2020.03.022_br0040","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 Struct. Algorithms"},{"key":"10.1016\/j.tcs.2020.03.022_br0050","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":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2020.03.022_br0060","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 Appl. Math."},{"key":"10.1016\/j.tcs.2020.03.022_br0070","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 Math."},{"issue":"2","key":"10.1016\/j.tcs.2020.03.022_br0080","article-title":"The game chromatic number of trees and forests","volume":"17","author":"Dunn","year":"2015","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2020.03.022_br0090","first-page":"143","article-title":"On the game chromatic number of some classes of graphs","volume":"35","author":"Faigle","year":"1993","journal-title":"Ars Comb."},{"key":"10.1016\/j.tcs.2020.03.022_br0100","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1038\/scientificamerican0481-18","article-title":"Mathematical games","volume":"244","author":"Gardner","year":"1981","journal-title":"Sci. Am."},{"key":"10.1016\/j.tcs.2020.03.022_br0110","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":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2020.03.022_br0120","unstructured":"F. Havet, Private communication, II Workshop Franco-br\u00e9silien de Graphes et Optimisation Combinatoire, Session on open problems of GCO-2016, Redonda, Brazil, 2016."},{"key":"10.1016\/j.tcs.2020.03.022_br0130","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":"J. Comb. Optim."},{"year":"2009","series-title":"Games, Puzzles, and Computation","author":"Hearn","key":"10.1016\/j.tcs.2020.03.022_br0140"},{"key":"10.1016\/j.tcs.2020.03.022_br0150","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 Appl. Math."},{"key":"10.1016\/j.tcs.2020.03.022_br0160","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\/j.tcs.2020.03.022_br0170","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":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.tcs.2020.03.022_br0180","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10479-014-1537-2","article-title":"Restricted coloring problems on graphs with few P4's","volume":"217","author":"Linhares-Sales","year":"2014","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.tcs.2020.03.022_br0190","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 Comb."},{"key":"10.1016\/j.tcs.2020.03.022_br0200","doi-asserted-by":"crossref","first-page":"2769","DOI":"10.1016\/j.dam.2012.01.025","article-title":"Minimal separators in extended P4-laden graphs","volume":"160","author":"Pedrotti","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2020.03.022_br0210","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":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2020.03.022_br0220","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 Math."},{"key":"10.1016\/j.tcs.2020.03.022_br0230","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":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2020.03.022_br0240","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":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.tcs.2020.03.022_br0250","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 Math."},{"key":"10.1016\/j.tcs.2020.03.022_br0260","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":"J. Comb. Theory, Ser. B"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752030181X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752030181X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T05:41:34Z","timestamp":1720244494000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439752030181X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":26,"alternative-id":["S030439752030181X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2020.03.022","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2020,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"PSPACE-completeness of two graph coloring games","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2020.03.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}