Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees
Under an Elsevier user license
open archive
Keywords
Locally bounded list-colorings
Dynamic programming
NP-completeness
Maximum flows
Tree-width
Split graphs
Cographs
Cited by (0)
© 2019 Elsevier B.V.