Kernelization for list $H$-coloring for graphs with small vertex cover

Marta Piecyk, Astrid Pieterse, Paweł Rzążewski +1

For a fixed graph $H$, in the List $H$-Coloring problem, we are given a graph $G$ along with list $L(v)\subseteq V(H)$ for every $v\in V(G)$, and we have to determine if there ex…