External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Andrei A. Krokhin

This author has not been identified. Look up 'Andrei A. Krokhin' in Google

Jakub Oprsal

This author has not been identified. Look up 'Jakub Oprsal' in Google
runs on