{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:53Z","timestamp":1725662873234},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540107040"},{"type":"electronic","value":"9783540386612"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10704-5_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:14:18Z","timestamp":1330172058000},"page":"9-19","source":"Crossref","is-referenced-by-count":4,"title":["A linear algorithm for five-coloring a planar graph"],"prefix":"10.1007","author":[{"given":"N.","family":"Chiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Saito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"2_CR1","volume-title":"Graphs and Network","author":"B. Carre","year":"1979","unstructured":"B. Carre, Graphs and Network, Clarendon Press, Oxford, 1979."},{"key":"2_CR2","unstructured":"N. Chiba, T. Nishizeki and N. Saito, An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs, submitted to SIAM J. on Comput., 1980."},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Jhonson and L. Stockmeyer, Some simplified NP-complete graph problems, Theor. Comput. Sci. 1, 237\u2013267, 1976.","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2_CR4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(78)90065-0","volume":"7","author":"R. J. Lipton","year":"1978","unstructured":"R. J. Lipton and R. E. Miller, A batching method for coloring planar graphs, Information Processing Letters, 7,4, 185\u2013188, 1978.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Graph Theory and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10704-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:38:49Z","timestamp":1619541529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10704-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540107040","9783540386612"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-10704-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}