Concepedia
Discrete Mathematics · 1989 · 126 citations · 2 references
ComputingComputer ScienceAlgorithmsCombinatoricsGraph ColoringApproximation Algorithms For ColoringGraph Coloring ComplexityTotal Coloring
2
The NP-Completeness of Edge-Coloring
Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations
Natural Sciences, Visualization, Color Theory +10
NP completeness of finding the chromatic index of regular graphs
Daniel Leven, Zvi Galil · Journal of Algorithms · 1983 · 191 citations
Natural Sciences, Visualization, Combinatorics +6