We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

The complexity of 3-colouring H-colourable graphs.

Krokhin, A. and Oprsal, J. (2020) 'The complexity of 3-colouring H-colourable graphs.', in 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS 2019) ; proceedings. Piscataway, NJ: IEEE, pp. 1227-1239.

Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher 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.
Date accepted:18 July 2019
Date deposited:05 September 2019
Date of first online publication:06 January 2020
Date first made open access:20 January 2020

Save or Share this output

Look up in GoogleScholar