Prefer a chat interface with context about you and your work?
Surjective H-colouring: New hardness results
A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v …