2 citations · 2 across the 4 of their papers we have counts for
1 paper · 1 filter
Sergey Avvakumov, Marek Filakovský, Jakub Opršal +2
We study the complexity of a class of promise graph homomorphism problems. For a fixed graph H, the H-colouring problem is to decide whether a given graph has a homomorphism to H.…