The Complexity of 3-Colouring H-Colourable Graphs

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]

Abstract

Abstract is missing.