Discrete Mathematics · 2012 · 49 citations · 29 references
ComputingForestryColor TheoryColor ManagementGraph AlgorithmsGraph ColoringGraph DrawingGraph LabelingGraph TheoryColoring Planar GraphsGraph Coloring ComplexityVertex Coloring
29
The NP-Completeness of Edge-Coloring
Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations
A New Algorithm for Generating All the Maximal Independent Sets
Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi et al. · SIAM Journal on Computing · 1977 · 615 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