Kernelization for $H$-Coloring

Yael Berkman, Ishay Haviv

For a fixed graph $H$, the $H$-Coloring problem asks whether a given graph admits an edge-preserving function from its vertex set to that of $H$. A seminal theorem of Hell and NeÅ¡…