Abstract

This thesis studies the kernelization complexity of graph coloring problems
with respect to certain structural parameterizations of the input instances, fol-
lowing up on a paper by Jansen and Kratsch (FCT, 2011). In their paper they
study how well polynomial-time data reductions can provably shrink instances
of coloring problems, in terms of the chosen
... read more