List H-Coloring a Graph by Removing Few Vertices

Rajesh Chitnis, Laszlo Egri, Daniel Marx

In the deletion version of the list homomorphism problem, we are given graphs G and H, a list L(v) that is a subset of V(H) for each vertex v of G, and an integer k. The task is to…