{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:29Z","timestamp":1725455429994},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016251","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"273-282","source":"Crossref","is-referenced-by-count":6,"title":["A fast parallel algorithm for six-colouring of planar graphs"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Diks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"\u2014 M. Ajtai, J. Komlos, E. Szemeredi, An O(nlog n) sorting network, Combinatorica 3,1 (1983), 1\u201319","journal-title":"Combinatorica"},{"key":"22_CR2","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"\u2014 C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973"},{"key":"22_CR3","first-page":"28","volume":"199","author":"F. Bauernoppel","year":"1985","unstructured":"\u2014 F. Bauernoppel, H. Jung, Fast parallel vertex colouring, Proc. 5th Conference on Fundamentals of Computation, LNCS 199, Springer-Verlag, 1985, 28\u201335","journal-title":"LNCS"},{"key":"22_CR4","unstructured":"\u2014 K. Diks, Parallel recognition of outer-planar graphs, paper in preparation"},{"key":"22_CR5","first-page":"9","volume":"108","author":"N. Chiba","year":"1981","unstructured":"\u2014 N. Chiba, T. Nishizeki, N. Saito, A linear algorithm for five colouring a planar graph, Proc. 1980 Symosium on graph theory and algorithms, LNCS 108, Springer-Verlag, 1981, 9\u201319","journal-title":"LNCS"},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"\u2014 M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simpliefied NP-complete graph problems, Theo. Comput. Sci. 1, 1976, 237\u2013267","journal-title":"Theo. Comput. Sci."},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","volume":"14","author":"L. Kucera","year":"1982","unstructured":"\u2014 L. Kucera, Parallel computations and conflicts in memory access, Inf. Pro. Letters 14, 1982, 93\u201396","journal-title":"Inf. Pro. Letters"},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"\u2014 Y. Shiloach, U. Vishkin, An O(log n) parallel connectivity algorithm, J. Algorithms 3, 1982, 57\u201363","journal-title":"J. Algorithms"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"\u2014 R.E.Tarjan, U.Vishkin, Finding biconnected components and computing tree functions in logarithmic parallel time, 25th Annual Symp. of FOCS, 1984, 14\u201320","DOI":"10.1109\/SFCS.1984.715896"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016251.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:44Z","timestamp":1607549744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0016251","relation":{},"subject":[]}}