Holyer, Ian The NP-completeness of edge-coloring. (English) Zbl 0473.68034 SIAM J. Comput. 10, 718-720 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 ReviewsCited in 393 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 05C15 Coloring of graphs and hypergraphs Keywords:chromatic index PDF BibTeX XML Cite \textit{I. Holyer}, SIAM J. Comput. 10, 718--720 (1981; Zbl 0473.68034) Full Text: DOI Link OpenURL