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. Electronic Colloquium on Computational Complexity (ECCC), 20:148, 2013. [doi]

Authors

Irit Dinur

This author has not been identified. Look up 'Irit Dinur' in Google

Igor Shinkar

This author has not been identified. Look up 'Igor Shinkar' in Google