{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T12:10:17Z","timestamp":1751285417631},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606925"},{"type":"electronic","value":"9783540492634"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60692-0_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:53:20Z","timestamp":1330289600000},"page":"37-51","source":"Crossref","is-referenced-by-count":10,"title":["Efficient algorithms for vertex arboricity of planar graphs"],"prefix":"10.1007","author":[{"given":"Abhik","family":"Roychoudhury","sequence":"first","affiliation":[]},{"given":"Susmita","family":"Sur-Kolay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"4_CR1","first-page":"151","volume-title":"Graph Theory with Applications to Algorithms and Computer Science","author":"I. Broere","year":"1985","unstructured":"I. Broere and C.M. Mynhardt, Generalized colorings of planar and outerplanar graphs, Y. Alavi et al., eds., Graph Theory with Applications to Algorithms and Computer Science(Wiley, New York, 1985), pp 151\u2013161."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(91)90166-Y","volume":"91","author":"W. Goddard","year":"1991","unstructured":"W. Goddard, Acyclic colorings of planar graphs, Discrete Mathematics 91, 1991, pp 91\u201394.","journal-title":"Discrete Mathematics"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"V.D. Agrawal, S. Seth and J.S. Deogun, Design for testability and test generation with 2 clocks, Univ. of Nebraska-Lincoln, Dept. of Comp. Sc. Engg, Report series #102, Feb 1990.","DOI":"10.1109\/ISVD.1991.185102"},{"key":"4_CR4","unstructured":"M. Garey and D.S. Johnson, Computers and Intractability: A complete guide to NP-completeness, Freeman, 1979."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"G. Chartrand and H.V. Kronk, The point arboricity of planar graphs, Journal of London Math. Soc., Vol 44, Part 4, Oct 1969.","DOI":"10.1112\/jlms\/s1-44.1.612"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"F. Harary, Graph theory, Addison Wesley Publishing Co., 1969.","DOI":"10.21236\/AD0705364"},{"key":"4_CR7","unstructured":"T. Nishizeki and N. Chiba, Planar graphs: theory and algorithms, North Holland Mathematics Studies 140, 1988."},{"key":"4_CR8","unstructured":"A. Roychoudhury, Cycle-coloring of planar and general graphs with applications to VLSI testing, BCSE Project Report, Jadavpur University, Dept. of Computer Sc. Engg., May 1995."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60692-0_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:01:18Z","timestamp":1605646878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60692-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606925","9783540492634"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-60692-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}