Algorithmica · 2013 · 43 citations · 19 references
Natural SciencesForestryColor TheoryGraph ColoringApproximation Algorithms For ColoringColoring TheoremsList Coloring
19
Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text
The NP-Completeness of Edge-Coloring
Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations
Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
Chı́nh T. Hoàng, Marcin Kamiński, Vadim Lozin et al. · Algorithmica · 2008 · 166 citations