Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
Restricted colorings of graphs
Surveys in combinatorics, 1993
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
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
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
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
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
Journal of Discrete Algorithms
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
Data reduction for graph coloring problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
L(2, 1, 1)-labeling is NP-complete for trees
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Incremental list coloring of graphs, parameterized by conservation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Distance three labelings of trees
Discrete Applied Mathematics
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
| Hi-index | 0.00 |
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.