{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:28:28Z","timestamp":1757626108972,"version":"3.44.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-9205982"],"award-info":[{"award-number":["CCR-9205982"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0166-218x(96)00089-3","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"183-198","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Parallel complexity of partitioning a planar graph into vertex-induced forests"],"prefix":"10.1016","volume":"69","author":[{"given":"Chen","family":"Zhi-Zhong","sequence":"first","affiliation":[]},{"given":"He","family":"Xin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(96)00089-3_BIB1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(85)90222-1","article-title":"An approach to the subgraph homeomorphism problem","volume":"38","author":"Asano","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(96)00089-3_BIB2","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1112\/jlms\/s1-44.1.612","article-title":"The point-arboricity of planar graphs","volume":"44","author":"Chartrand","year":"1969","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0166-218X(96)00089-3_BIB3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02760181","article-title":"The point-arboricity of a graph","volume":"6","author":"Chartrand","year":"1968","journal-title":"Israel J. Math."},{"year":"1986","series-title":"Graphs and Digraphs","author":"Chartrand","key":"10.1016\/0166-218X(96)00089-3_BIB4"},{"key":"10.1016\/0166-218X(96)00089-3_BIB5","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","article-title":"Deterministic coin tossing with applications to optimal parallel list ranking","volume":"70","author":"Cole","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0166-218X(96)00089-3_BIB6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(91)90166-Y","article-title":"Acyclic colorings of graphs","volume":"91","author":"Goddard","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(96)00089-3_BIB7","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1137\/0218020","article-title":"Optimal parallel 5-colouring of planar graphs","volume":"18","author":"Hagerup","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(96)00089-3_BIB8","series-title":"Algorithms and Complexity","first-page":"869","article-title":"A survey of parallel algorithms for shared-memory machines","volume":"Volume A","author":"Karp","year":"1990"},{"key":"10.1016\/0166-218X(96)00089-3_BIB9","series-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science","first-page":"173","article-title":"A linear-processor polylog-time algorithm for shortest paths in planar graphs","author":"Klein","year":"1993"},{"key":"10.1016\/0166-218X(96)00089-3_BIB10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/jgt.3190140108","article-title":"On the linear vertex-arboricity of a planar graph","volume":"14","author":"Poh","year":"1990","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X96000893?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X96000893?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:49:41Z","timestamp":1757450981000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X96000893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0166218X96000893"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(96)00089-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1996,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallel complexity of partitioning a planar graph into vertex-induced forests","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0166-218X(96)00089-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}