Improved hardness for H -colourings of G -colourable graphs

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Marcin Wrochna, Stanislav Živný

Journal title: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms

Journal publisher: Society for Industrial and Applied Mathematics

Published year: 2020

Published pages: 1426-1435

DOI identifier: 10.1137/1.9781611975994.86

ISBN: 978-1-61197-599-4