Vertex-Coloring Edge-Weighting: Kernelization and Generalization
This work shows that both pre-weighted problems have polynomial kernels when parameterized by $k, and shows that both problems are W[1]-hard parameterized by treedepth, answering another question from earlier work.