{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:06:11Z","timestamp":1710349571184},"reference-count":4,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1016\/0196-6774(81)90031-6","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"317-327","source":"Crossref","is-referenced-by-count":40,"title":["A linear 5-coloring algorithm of planar graphs"],"prefix":"10.1016","volume":"2","author":[{"given":"Norishige","family":"Chiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuji","family":"Saito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(81)90031-6_BIB1","series-title":"Graphs and Network","author":"Carre","year":"1979"},{"key":"10.1016\/0196-6774(81)90031-6_BIB2","unstructured":"N. Chiba, T. Nishizeki, and N. Saito, An approximation algorithm for the maximum independent set problem on planar graphs, submitted for publication."},{"key":"10.1016\/0196-6774(81)90031-6_BIB3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theor. Comput. Sci."},{"issue":"No. 4","key":"10.1016\/0196-6774(81)90031-6_BIB4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(78)90065-0","article-title":"A batching method for coloring planar graphs","volume":"7","author":"Lipton","year":"1978","journal-title":"Inform. Process. Lett."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677481900316?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677481900316?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:52:23Z","timestamp":1548744743000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677481900316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["0196677481900316"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(81)90031-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}