Parameterized Pre-Coloring Extension and List Coloring Problems

Gregory Gutin, Diptapriyo Majumdar, Sebastian Ordyniak & Magnus Wahlström
Golovach, Paulusma and Song (Inf. Comput. 2014) asked to determine the parameterized complexity of the following problems parameterized by k: (1) Given a graph G, a clique modulator D (a clique modulator is a set of vertices, whose removal results in a clique) of size k for G, and a list L(v) of colors for every v ∈ V(G), decide whether G has a proper list coloring; (2) Given a graph G, a clique modulator...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.