{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T12:08:45Z","timestamp":1751285325041},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4946,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0304-3975(97)00254-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:04:53Z","timestamp":1027631093000},"page":"75-95","source":"Crossref","is-referenced-by-count":12,"title":["Efficient algorithms for acyclic colorings of graphs"],"prefix":"10.1016","volume":"230","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00254-5_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\/S0304-3975(97)00254-5_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\/S0304-3975(97)00254-5_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."},{"key":"10.1016\/S0304-3975(97)00254-5_BIB4","doi-asserted-by":"crossref","unstructured":"Z.-Z. Chen, NC algorithms for partitioning sparse graphs into induced forests with an application, in: Proc. 6th Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, vol. 1004, Springer, Berlin, 1995, pp. 428\u2013437.","DOI":"10.1007\/BFb0015449"},{"key":"10.1016\/S0304-3975(97)00254-5_BIB5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0166-218X(96)00089-3","article-title":"Parallel complexity of partitioning a planar graph into vertex-induced forests","volume":"69","author":"Chen","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(97)00254-5_BIB6","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1137\/0222040","article-title":"Finding triconnected components by local replacement","volume":"22","author":"Fussell","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00254-5_BIB7","unstructured":"M. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979."},{"key":"10.1016\/S0304-3975(97)00254-5_BIB8","first-page":"91","volume":"91","author":"Goddard","year":"1991","journal-title":"acyclic colorings of planar graphs, Discrete Math."},{"key":"10.1016\/S0304-3975(97)00254-5_BIB9","series-title":"Proc. 19th ACM Symp. on Theory of Comput.","first-page":"315","article-title":"Parallel symmetry-breaking in sparse graphs","author":"Goldberg","year":"1987"},{"key":"10.1016\/S0304-3975(97)00254-5_BIB10","doi-asserted-by":"crossref","unstructured":"A. Kanevsky, V. Ramachandran, Improved algorithms for graph four-connectivity, in: Proc. 28th IEEE Symp. on Foundations of Computer Science, IEEE, 1987, pp. 252\u2013259.","DOI":"10.1109\/SFCS.1987.33"},{"key":"10.1016\/S0304-3975(97)00254-5_BIB11","doi-asserted-by":"crossref","unstructured":"A. K\u00e9zdy, P. McGuinness, Sequential and parallel algorithms to find a K5 minor, in: Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, SIAM, 1992, pp. 345\u2013356.","DOI":"10.21236\/ADA232901"},{"key":"10.1016\/S0304-3975(97)00254-5_BIB12","doi-asserted-by":"crossref","unstructured":"V. Ramachandran, J. Reif, An optimal parallel algorithm for graph planarity, in: Proc. 30th IEEE Symp. on Foundations of Computer Science, IEEE, 1989, pp. 282\u2013287.","DOI":"10.1109\/SFCS.1989.63491"},{"key":"10.1016\/S0304-3975(97)00254-5_BIB13","doi-asserted-by":"crossref","unstructured":"A. Roychoudhury, S. Sur-Kolay, Efficient algorithms for vertex arboricity of planar graphs, in: Proc. 15th Internat. Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 1026, Springer, Berlin, 1995, pp. 37\u201351.","DOI":"10.1007\/3-540-60692-0_39"},{"key":"10.1016\/S0304-3975(97)00254-5_BIB14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(logn) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00254-5_BIB15","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00254-5_BIB16","series-title":"Proc. 10th ACM Symp. on Theory of Comput.","first-page":"253","article-title":"Node- and edge-deletion NP-complete problems","author":"Yannakakis","year":"1978"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002545?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002545?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T15:43:18Z","timestamp":1580830998000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0304397597002545"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00254-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}