On sum coloring and sum multi-coloring for restricted families of graphs☆
Under an Elsevier user license
open archive
Keywords
Sum coloring
Sum multi-coloring
Approximation algorithms
Greedy algorithms
Priority lower bound
Graph algorithms
NP-hardness
Geometric intersection graphs
Clawfree graphs
Unit disk graphs
Interval graphs
Cited by (0)
- ☆
This work was supported by the Natural Sciences and Engineering Research Council of Canada and the Department of Computer Science, University of Toronto.
Copyright © 2011 Elsevier B.V. All rights reserved.