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]
@article{DinurS13,
title = {On the Conditional Hardness of Coloring a 4-colorable Graph with Super-Constant Number of Colors},
author = {Irit Dinur and Igor Shinkar},
year = {2013},
url = {http://eccc.hpi-web.de/report/2013/148},
researchr = {https://researchr.org/publication/DinurS13},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {20},
pages = {148},
}