Complexity results for minimum sum edge coloring

Discrete Applied Mathematics

Volumn 157, Issue 5, 2009, Pages 1034-1045

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Graph coloring; Minimum sum coloring; NP completeness

Indexed keywords

COLORING; GRAPH THEORY;

2-TREES; BIPARTITE GRAPHS; COMPLEXITY RESULTS; EDGE COLORINGS; GRAPH COLORING; MAXIMUM DEGREE 3; MINIMUM SUM COLORING; NP-COMPLETENESS; NP-HARD; PLANAR GRAPHS; POSITIVE INTEGERS;

TREES (MATHEMATICS);

EID: 60649118921     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.04.002     Document Type: Article

References (28)

1. Alimonti P., and Kann V. Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237 1-2 (2000) 123-134
2. Bar-Noy A., Bellare M., Halldórsson M.M., Shachnai H., and Tamir T. On chromatic sums and distributed resource allocation. Inform. and Comput. 140 2 (1998) 183-202
3. Bar-Noy A., and Kortsarz G. Minimum color sum of bipartite graphs. J. Algorithms 28 2 (1998) 339-365
4. Biró M., Hujter M., and Tuza Zs. Precoloring extension. I. Interval graphs. Discrete Math. 100 1-3 (1992) 267-279
5. Bodlaender H.L. A tourist guide through treewidth. Acta Cybernet. 11 1-2 (1993) 1-21
6. Bodlaender H.L. Treewidth: Algorithmic techniques and results. Mathematical Foundations of Computer Science 1997 (Bratislava) (1997), Springer, Berlin 19-36
7. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 1-2 (1998) 1-45
8. R. Gandhi, J. Mestre, Combinatorial algorithms for data migration, Algorithmica (in press)
9. Giaro K., Janczewski R., Kubale M., and Małafiejski M. A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs. APPROX 2002. Lecture Notes in Comput. Sci. vol. 2462 (2002), Springer, Berlin 135-145
10. Giaro K., and Kubale M. Edge-chromatic sum of trees and bounded cyclicity graphs. Inform. Process. Lett. 75 1-2 (2000) 65-69
11. Halldórsson M.M., Kortsarz G., and Shachnai H. Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs. Algorithmica 37 3 (2003) 187-209
12. Hujter M., and Tuza Zs. Precoloring extension. II. Graph classes related to bipartite graphs. Acta Mathematica Universitatis Comenianae 62 1 (1993) 1-11
13. Hujter M., and Tuza Zs. Precoloring extension. III. Classes of perfect graphs. Combin. Probab. Comput. 5 1 (1996) 35-56
14. Jansen K. The optimum cost chromatic partition problem. Algorithms and Complexity, Rome, 1997. Lecture Notes in Comput. Sci. vol. 1203 (1997), Springer, Berlin 25-36
15. E. Kubicka, The Chromatic Sum of a Graph, Ph.D. Thesis, Western Michigan University, 1989
16. Kubicka E., and Schwenk A.J. An introduction to chromatic sums. Proceedings of the ACM Computer Science Conf. (1989), Springer, Berlin 15-21
17. Lovász L. The membership problem in jump systems. J. Combin. Theory Ser. B 70 1 (1997) 45-66
18. Marcotte O., and Seymour P.D. Extending an edge-coloring. J. Graph Theory 14 5 (1990) 565-573
19. Marx D. Minimum sum multicoloring on the edges of planar graphs and partial k-trees. 2nd International Workshop on Approximation and Online Algorithms. WAOA 2004, Bergen. Lecture Notes in Computer Science vol. 3351 (2005), Springer, Berlin 9-22
20. Marx D. NP-completeness of list coloring and precoloring extension on the edges of planar graphs. J. Graph Theory 49 4 (2005) 313-324
21. Marx D. The complexity of chromatic strength and chromatic edge strength. Comput. Complexity 14 4 (2006) 308-340
22. Nicoloso S., Sarrafzadeh M., and Song X. On the sum coloring problem on interval graphs. Algorithmica 23 2 (1999) 109-126
23. Nishizeki T., Vygen J., and Zhou X. The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Appl. Math. 115 1-3 (2001) 177-186
24. Salavatipour M.R. On sum coloring of graphs. Discrete Appl. Math. 127 3 (2003) 477-488
25. Supowit K.J. Finding a maximum planar subset of nets in a channel. IEEE Trans. Comput. Aided Design 6 1 (1987) 93-94
26. Szkaliczki T. Routing with minimum wire length in the dogleg-free Manhattan model is NP-complete. SIAM J. Comput. 29 1 (1999) 274-287
27. Tuza Zs. Graph colorings with local constraints-A survey. Discuss. Math. Graph Theory 17 2 (1997) 161-228
28. Zhou X., and Nishizeki T. Algorithm for the cost edge-coloring of trees. J. Comb. Optim. 8 1 (2004) 97-108