Andrei A. Krokhin, Jakub Oprsal. The Complexity of 3-Colouring H-Colourable Graphs. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019. pages 1227-1239, IEEE Computer Society, 2019. [doi]
@inproceedings{KrokhinO19-0,
title = {The Complexity of 3-Colouring H-Colourable Graphs},
author = {Andrei A. Krokhin and Jakub Oprsal},
year = {2019},
doi = {10.1109/FOCS.2019.00076},
url = {https://doi.org/10.1109/FOCS.2019.00076},
researchr = {https://researchr.org/publication/KrokhinO19-0},
cites = {0},
citedby = {0},
pages = {1227-1239},
booktitle = {60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019},
editor = {David Zuckerman},
publisher = {IEEE Computer Society},
isbn = {978-1-7281-4952-3},
}