Parameterized complexity of coloring problems: Treewidth versus vertex cover

Authors:
Jií Fiala;Petr A. Golovach;Jan Kratochvíl
Affiliations:
Department of Applied Mathematics and Institute for Theoretical Computer Science (ITI),11ITI is supported by the Ministry of Education of the Czech Republic as project 1M0545. Charles University, ...;School of Engineering and Computing Sciences, Durham University, South Road, Durham DH1 3LE, UK;Department of Applied Mathematics and Institute for Theoretical Computer Science (ITI),11ITI is supported by the Ministry of Education of the Czech Republic as project 1M0545. Charles University, ...
Venue:
Theoretical Computer Science
Year:
2011

Citing 20
Cited 5

An application of simultaneous Diophantine approximation in combinatorial optimization

Combinatorica
Minkowski's convex body theorem and integer programming

Mathematics of Operations Research
Nondeterminism within P

SIAM Journal on Computing
Restricted colorings of graphs

Surveys in combinatorics, 1993
Fixed-parameter tractability and completeness II: on completeness for W[1]

Theoretical Computer Science
Non-standard approaches to integer programming

Discrete Applied Mathematics
Coloring Powers of Planar Graphs

SIAM Journal on Discrete Mathematics
Equitable colorings of bounded treewidth graphs

Theoretical Computer Science - Graph colorings
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography

The Computer Journal
List-Coloring Squares of Sparse Subcubic Graphs

SIAM Journal on Discrete Mathematics
Coloring squares of planar graphs with girth six

European Journal of Combinatorics
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Graph Layout Problems Parameterized by Vertex Cover

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
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
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
Treewidth: characterizations, applications, and computations

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Distance constrained labelings of graphs of bounded treewidth

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Parameterized Complexity

Parameterized Complexity
Combinatorial Optimization on Graphs of Bounded Treewidth

The Computer Journal

On Bounded-Degree Vertex Deletion parameterized by treewidth

Discrete Applied Mathematics
Twin-Cover: beyond vertex cover in parameterized algorithmics

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics
Incremental list coloring of graphs, parameterized by conservation

Theoretical Computer Science
Data reduction for graph coloring problems

Information and Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

We compare the fixed parameter complexity of various variants of coloring problems (including List Coloring, Precoloring Extension, Equitable Coloring, L(p,1)-Labeling and Channel Assignment) when parameterized by treewidth and by vertex cover number. In most (but not all) cases we conclude that parametrization by the vertex cover number provides a significant drop in the complexity of the problems.