{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T23:20:54Z","timestamp":1775085654224,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,18]],"date-time":"2007-10-18T00:00:00Z","timestamp":1192665600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00453-007-9044-3","type":"journal-article","created":{"date-parts":[[2007,10,17]],"date-time":"2007-10-17T14:41:31Z","timestamp":1192632091000},"page":"351-368","source":"Crossref","is-referenced-by-count":14,"title":["New Linear-Time Algorithms for Edge-Coloring Planar Graphs"],"prefix":"10.1007","volume":"50","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[]},{"given":"\u0141ukasz","family":"Kowalik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,18]]},"reference":[{"key":"9044_CR1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(89)90022-9","volume":"10","author":"M. Chrobak","year":"1989","unstructured":"Chrobak, M., Yung, M.: Fast algorithms for edge-coloring planar graphs. J. Algorithms 10, 35\u201351 (1989)","journal-title":"J. Algorithms"},{"key":"9044_CR2","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0196-6774(90)90032-A","volume":"11","author":"M. Chrobak","year":"1990","unstructured":"Chrobak, M., Nishizeki, T.: Improved edge-coloring algorithms for planar graphs. J. Algorithms 11, 102\u2013116 (1990)","journal-title":"J. Algorithms"},{"key":"9044_CR3","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: On the estimate of the chromatic class of a p-graph. Diskret. Anal. 3, 25\u201330 (1964)","journal-title":"Diskret. Anal."},{"key":"9044_CR4","unstructured":"Gabow, H.N., Nishizeki, T., Kariv, O., Leven, D., Terada, O.: Algorithms for edge coloring graphs. Technical Report TR-41\/85, Department of Computer Science, Tel Aviv University (1985)"},{"key":"9044_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R. Cole","year":"2001","unstructured":"Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(Elog\u2009D) time. Combinatorica 21, 5\u201312 (2001)","journal-title":"Combinatorica"},{"issue":"6","key":"9044_CR6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0020-0190(02)00446-5","volume":"85","author":"N. Alon","year":"2003","unstructured":"Alon, N.: A simple algorithm for edge-coloring bipartite multigraphs. Inf. Process. Lett. 85(6), 301\u2013302 (2003)","journal-title":"Inf. Process. Lett."},{"key":"9044_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0020-0190(01)00221-6","volume":"81","author":"S. Skulrattanakulchai","year":"2002","unstructured":"Skulrattanakulchai, S.: 4-edge-coloring graphs of maximum degree 3 in linear time. Inf. Process. Lett. 81, 191\u2013195 (2002)","journal-title":"Inf. Process. Lett."},{"key":"9044_CR8","first-page":"9","volume":"5","author":"V.G. Vizing","year":"1965","unstructured":"Vizing, V.G.: Critical graphs with a given chromatic number. Diskret. Anal. 5, 9\u201317 (1965)","journal-title":"Diskret. Anal."},{"key":"9044_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1006\/jctb.2001.2047","volume":"83","author":"D.P. Sanders","year":"2001","unstructured":"Sanders, D.P., Zhao, Y.: Planar graphs of maximum degree 7 are class I. J. Comb. Theory Ser. B 83, 201\u2013212 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9044_CR10","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1017\/S0370164600044229","volume":"10","author":"P.G. Tait","year":"1878","unstructured":"Tait, P.G.: On the coloring of maps. Proc. R. Soc. Edinb. Sect. A 10, 501\u2013503 (1878)","journal-title":"Proc. R. Soc. Edinb. Sect. A"},{"key":"9044_CR11","first-page":"571","volume-title":"Proceedings of the 28th Symposium on Theory of Computing","author":"N. Robertson","year":"1996","unstructured":"Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: Efficiently four-coloring planar graphs. In: Proceedings of the 28th Symposium on Theory of Computing, pp. 571\u2013575. ACM, New York (1996)"},{"key":"9044_CR12","unstructured":"Sanders, D.P.: Private communication (2005)"},{"key":"9044_CR13","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-3975(90)90079-W","volume":"74","author":"X. He","year":"1990","unstructured":"He, X.: An efficient algorithm for edge coloring planar graphs with \u0394 colors. Theor. Comput. Sci. 74, 299\u2013312 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"9044_CR14","first-page":"180","volume":"394","author":"O.V. Borodin","year":"1989","unstructured":"Borodin, O.V.: On the total coloring of planar graphs. J. Reine Angew. Math. 394, 180\u2013185 (1989)","journal-title":"J. Reine Angew. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9044-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9044-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9044-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:44:59Z","timestamp":1559137499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9044-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,18]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9044"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9044-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,18]]}}}