A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On the complexity of some colorful problems parameterized by treewidth

2011
*
Information and Computation
*

In this paper we study the complexity of several coloring problems on graphs, parameterized by the treewidth of the graph. 1. The LIST COLORING problem takes as input a graph G, together with an assignment to each vertex v of a set of colors C v . The problem is to determine whether it is possible to choose a color for vertex v from the set of permitted colors C v , for each vertex, so that the obtained coloring of G is proper. We show that this problem is W [1]-hard, parameterized by the

doi:10.1016/j.ic.2010.11.026
fatcat:sfyj6cofungeplh5riskcy6s5u