Approximability Distance in the Space of H-Colourability Problems

Tommy Färnqvist, Peter Jonsson, Johan Thapper

A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. We study the approximability properties of the Weighted Maximum H-Colourabl…