Bounds and Fixed-Parameter Algorithms for Weighted Improper Coloring


We study the weighted improper coloring problem, a generalization of defective coloring. We present some hardness results and in particular we show that weighted improper coloring is not fixed-parameter tractable when parameterized by pathwidth. We generalize bounds for defective coloring to weighted improper coloring and give a bound for weighted improper… (More)
DOI: 10.1016/j.entcs.2016.03.013


3 Figures and Tables

Slides referencing similar topics