Scheduling with incompatible jobs
Discrete Applied Mathematics
Generalized coloring for tree-like graphs
Discrete Applied Mathematics
Graph classes: a survey
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
Parameterized complexity of vertex colouring
Discrete Applied Mathematics
Parameterized coloring problems on chordal graphs
Theoretical Computer Science - Parameterized and exact computation
Invitation to data reduction and problem kernelization
ACM SIGACT News
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
On problems without polynomial kernels
Journal of Computer and System Sciences
Kernelization: New Upper and Lower Bound Techniques
Parameterized and Exact Computation
A Certifying Algorithm for 3-Colorability of P5-Free Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Known algorithms on graphs of bounded treewidth are probably optimal
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Parameterized Complexity
Parameterized Complexity and Approximation Algorithms
The Computer Journal
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
Hi-index | 0.00 |
This paper studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances. We are interested in how well polynomial-time data reduction can provably shrink instances of coloring problems, in terms of the chosen parameter. It is well known that deciding 3-colorability is already NP-complete, hence parameterizing by the requested number of colors is not fruitful. Instead, we pick up on a research thread initiated by Cai (DAM, 2003) who studied coloring problems parameterized by the modification distance of the input graph to a graph class on which coloring is polynomial-time solvable; for example parameterizing by the number k of vertex-deletions needed to make the graph chordal. We obtain various upper and lower bounds for kernels of such parameterizations of q-Coloring, complementing Cai@?s study of the time complexity with respect to these parameters. Our results show that the existence of polynomial kernels for q-Coloring parameterized by the vertex-deletion distance to a graph class F is strongly related to the existence of a function f(q) which bounds the number of vertices which are needed to preserve the no-answer to an instance of q-List Coloring on F.