78 citations · 116 across the 14 of their papers we have counts for
1 paper · 2 filters
Andrei Krokhin, Jakub Opršal
We study the complexity of approximation on satisfiable instances for graph homomorphism problems. For a fixed graph H, the H-colouring problem is to decide whether a given gra…