Leven, Daniel; Galil, Zvi NP-completeness of finding the chromatic index of regular graphs. (English) Zbl 0509.68037 J. Algorithms 4, 35-44 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 ReviewsCited in 84 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68R10 Graph theory (including graph drawing) in computer science 05C15 Coloring of graphs and hypergraphs Keywords:edge color PDF BibTeX XML Cite \textit{D. Leven} and \textit{Z. Galil}, J. Algorithms 4, 35--44 (1983; Zbl 0509.68037) Full Text: DOI OpenURL