On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors

Irit Dinur, Igor Shinkar. On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors. In Maria J. Serna, Ronen Shaltiel, Klaus Jansen, José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings. Volume 6302 of Lecture Notes in Computer Science, pages 138-151, Springer, 2010. [doi]

Abstract

Abstract is missing.