Information Processing Letters · 2005 · 55 citations · 4 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsGraph ColoringApproximation Algorithms For ColoringColoring Sparse GraphsColoring TheoremsComplexityGraph Coloring ApproximationGraph Coloring Complexity
4
The Complexity of Coloring Circular Arcs and Chords
M. R. Garey, David S. Johnson, Gary L. Miller et al. · SIAM Journal on Algebraic and Discrete Methods · 1980 · 391 citations
Generalized coloring for tree-like graphs
Klaus Jansen, Petra Scheffler · Discrete Applied Mathematics · 1997 · 110 citations
Algorithmic complexity of list colorings
Jan Kratochvı́l, Zsolt Tuza · Discrete Applied Mathematics · 1994 · 71 citations
A coloring problem for weighted graphs
D.J. Guan, Xuding Zhu · Information Processing Letters · 1997 · 50 citations