The complexity of 3-colouring H-colourable graphs

Krokhin, A.; Oprsal, J.

doi:10.1109/focs.2019.00076

The complexity of 3-colouring H-colourable graphs

Krokhin, A.; Oprsal, J.

Authors

Professor Andrei Krokhin andrei.krokhin@durham.ac.uk
Professor

J. Oprsal

Contributors

D. Zuckerman
Editor

Citation

Krokhin, A., & Oprsal, J. (2020). The complexity of 3-colouring H-colourable graphs. In D. Zuckerman (Ed.), 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS 2019) ; proceedings (1227-1239). https://doi.org/10.1109/focs.2019.00076

Conference Name	Foundations of Computer Science (FOCS)
Conference Location	Baltimore, USA
Start Date	Nov 9, 2019
End Date	Nov 12, 2019
Acceptance Date	Jul 18, 2019
Online Publication Date	Jan 6, 2020
Publication Date	Jan 6, 2020
Deposit Date	Jul 18, 2019
Publicly Available Date	Jan 20, 2020
Pages	1227-1239
Series ISSN	2575-8454
Book Title	2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS 2019) ; proceedings.
DOI	https://doi.org/10.1109/focs.2019.00076
Public URL	https://durham-repository.worktribe.com/output/1143780
Related Public URLs	https://arxiv.org/abs/1904.03214

Files

Accepted Conference Proceeding (1 Mb)
PDF

Copyright Statement
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.