Dual parameterization of Weighted Coloring

Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima +3

Given a graph $G$, a proper $k$-coloring of $G$ is a partition $c=(S_i{)}_{i\in [1,k]}$ of $V(G)$ into $k$ stable sets $S_1,\dots ,S_k$. Given a weight function $w: V(G) \to \ma…