The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Easy problems for tree-decomposable graphs
Journal of Algorithms
Restricted colorings of graphs
Surveys in combinatorics, 1993
Every planar graph is 5-choosable
Journal of Combinatorial Theory Series B
Generalized coloring for tree-like graphs
Discrete Applied Mathematics
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science - Graph colorings
A list analogue of equitable coloring
Journal of Graph Theory
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
On the complexity of some colorful problems parameterized by treewidth
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Capacitated domination and covering: a parameterized perspective
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Milling a graph with turn costs: a parameterized complexity perspective
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Connected coloring completion for general graphs: algorithms and complexity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Quadratic kernelization for convex recoloring of trees
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Parameterized Complexity
Data reduction for graph coloring problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
List-coloring graphs without subdivisions and without immersions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Twin-Cover: beyond vertex cover in parameterized algorithmics
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Cluster vertex deletion: a parameterization between vertex cover and clique-width
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
European Journal of Combinatorics
Information Processing Letters
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
Data reduction for graph coloring problems
Information and Computation
Hi-index | 0.02 |
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 treewidth of G. The closely related Precoloring Extension problem is also shown to be W[1]-hard, parameterized by treewidth. 2.An equitable coloring of a graph G is a proper coloring of the vertices where the numbers of vertices having any two distinct colors differs by at most one. We show that the problem is hard for W[1], parameterized by the treewidth plus the number of colors. We also show that a list-based variation, List Equitable Coloring is W[1]-hard for forests, parameterized by the number of colors on the lists. 3.The list chromatic number@g"l(G) of a graph G is defined to be the smallest positive integer r, such that for every assignment to the vertices v of G, of a list L"v of colors, where each list has length at least r, there is a choice of one color from each vertex list L"v yielding a proper coloring of G. We show that the problem of determining whether @g"l(G)=