Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2019

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

(1)
1
Cédric Bentz

Abstract

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-coloring of the vertices of a graph such that the total weight of vertices of each color equals a given value in each part of a fixed partition of the vertices exists. We also show that this result is tight in some sense, by providing hardness results for the cases where any one of the assumptions does not hold. The edge-coloring variant is also studied, as well as special cases of cographs and split graphs.
Fichier principal
Vignette du fichier
1709.05000.pdf (337.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02444296 , version 1 (20-01-2020)

Identifiers

Cite

Cédric Bentz. Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees. Theoretical Computer Science, 2019, 782, pp.11-29. ⟨10.1016/j.tcs.2019.02.029⟩. ⟨hal-02444296⟩
55 View
96 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More