{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:00:21Z","timestamp":1783576821500,"version":"3.55.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":[[1990,3]]},"DOI":"10.1016\/0196-6774(90)90032-a","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"102-116","source":"Crossref","is-referenced-by-count":20,"title":["Improved edge-coloring algorithms for planar graphs"],"prefix":"10.1016","volume":"11","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(90)90032-A_BIB1","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1090\/S0002-9904-1976-14122-5","article-title":"Every planar map is four colorable","volume":"82","author":"Appel","year":"1976","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0196-6774(90)90032-A_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0196-6774(90)90032-A_BIB3","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/0196-6774(87)90046-0","article-title":"Coloring planar graphs in parallel","volume":"8","author":"Boyar","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(90)90032-A_BIB4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0196-6774(81)90031-6","article-title":"A linear algorithm for five-coloring a planar graph","volume":"2","author":"Chiba","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(90)90032-A_BIB5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(89)90022-9","article-title":"Fast algorithms for edge-coloring planar graphs","volume":"10","author":"Chrobak","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(90)90032-A_BIB6","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0211043","article-title":"On edge coloring bipartite graphs","volume":"11","author":"Cole","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90032-A_BIB7","series-title":"Proceedings 18th ACM STOC","first-page":"206","article-title":"Deterministic coin tossing and accelerating cascades: Micro and marco techniques for designing parallel algorithms","author":"Cole","year":"1986"},{"key":"10.1016\/0196-6774(90)90032-A_BIB8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(84)90056-5","article-title":"On linear-time algorithms for five-coloring planar graphs","volume":"19","author":"Frederickson","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(90)90032-A_BIB9","series-title":"Edge-Colourings of Graphs","author":"Fiorini","year":"1977"},{"key":"10.1016\/0196-6774(90)90032-A_BIB10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(90)90032-A_BIB11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/0211009","article-title":"Algorithms for edge coloring bipartite graphs and multigraphs","volume":"11","author":"Gabow","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90032-A_BIB12","series-title":"Algorithms for Edge-Coloring Graphs","author":"Gabow","year":"1985"},{"key":"10.1016\/0196-6774(90)90032-A_BIB13","series-title":"Proceedings, 19th Annual ACM Symp. on Theory of Computing","article-title":"Parallel symmetry breaking in sparse graphs","author":"Goldberg","year":"1987"},{"key":"10.1016\/0196-6774(90)90032-A_BIB14","series-title":"Proceedings, 14th Int. Conf. on Automata, Languages and Programming, Karslruhe, 1987","first-page":"288","article-title":"Optimal parallel 5-colouring of planar graphs","volume":"18","author":"Hagerup","year":"1989"},{"key":"10.1016\/0196-6774(90)90032-A_BIB15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0196-6774(86)90039-8","article-title":"A better than \u201cbest possible\u201d algorithm to edge color multigraphs","volume":"7","author":"Hochbaum","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(90)90032-A_BIB16","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90032-A_BIB17","article-title":"The Computational Complexity of Graph Theory Problems","author":"Holyer","year":"1980"},{"key":"10.1016\/0196-6774(90)90032-A_BIB18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0196-6774(87)90026-5","article-title":"Efficient parallel algorithms for edge coloring problems","volume":"8","author":"Karloff","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(90)90032-A_BIB19","series-title":"Proceedings, 17th ACM STOC '85","first-page":"1036","article-title":"A simple parallel algorithm for the maximal independent set problem","volume":"15","author":"Luby","year":"1986"},{"key":"10.1016\/0196-6774(90)90032-A_BIB20","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","article-title":"NP-completeness of finding the chromatic index of regular graphs","volume":"4","author":"Leven","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(90)90032-A_BIB21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","article-title":"A fast parallel algorithm for routing in permutation networks","volume":"C-30","author":"Lev","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(90)90032-A_BIB22","unstructured":"D. Matula, Y. Shiloah, and R. Tarjan, \u201cTwo linear-time algorithms for five-coloring a planar graph,\u201d Tech. Rep. No. STAN-CS-80-830, Department of Computer Science, Stanford University."},{"key":"10.1016\/0196-6774(90)90032-A_BIB23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(87)90092-5","article-title":"A fast parallel coloring of planar graphs with five colors","volume":"25","author":"Naor","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(90)90032-A_BIB24","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/sapm1949281148","article-title":"A theorem on colouring lines of a network","volume":"28","author":"Shannon","year":"1949","journal-title":"J. Math. Phys."},{"key":"10.1016\/0196-6774(90)90032-A_BIB25","first-page":"25","article-title":"On the estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Discret. Anal."},{"key":"10.1016\/0196-6774(90)90032-A_BIB26","first-page":"9","article-title":"Critical graphs with a given chromatic number","volume":"5","author":"Vizing","year":"1965","journal-title":"Diskret. Anal."},{"issue":"No. 1","key":"10.1016\/0196-6774(90)90032-A_BIB27","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1093\/comjnl\/28.1.78","article-title":"A linear algorithm for coloring planar graphs with five colors","volume":"28","author":"Williams","year":"1985","journal-title":"Comput. J."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749090032A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749090032A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:54:18Z","timestamp":1548726858000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749090032A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["019667749090032A"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(90)90032-a","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}