Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees

Cédric Bentz

For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-co…