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
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
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Does treewidth help in modal satisfiability?
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
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
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
Incremental list coloring of graphs, parameterized by conservation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Does Treewidth Help in Modal Satisfiability?
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χ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 Lv of colors, where each list has length at least r, there is a choice of one color from each vertex list Lv yielding a proper coloring of G. We show that the problem of determining whether χl(G) ≤ r, the LIST CHROMATIC NUMBER problem, is solvable in linear time for every fixed treewidth bound t. The method by which this is shown is new and of general applicability. (2) The LIST COLORING problem takes as input a graph G, together with an assignment to each vertex v of a set of colors Cv. The problem is to determine whether it is possible to choose a color for vertex v from the set of permitted colors Cv, 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. (3) 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 (t, r). We also show that a list-based variation, LIST EQUITABLE COLORING is W[1]-hard for trees, parameterized by the number of colors on the lists.