On sum coloring of graphs

Discrete Applied Mathematics

Volumn 127, Issue 3, 2003, Pages 477-488

  Salavatipour, Mohammad R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Chromatic sum; Edge strength; Edge sum coloring; NP complete; Optimum cost chromatic partition; Vertex strength

Indexed keywords

EID: 84867958062     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00249-4     Document Type: Article

References (21)

1. A. Bar-Noy, M. Bellare, M.M. Halldorsson, H. Shachnai, and T. Tamir On chromatic sums and distributed resource allocation Inform. and Comput. 140 1998 183 202
2. A. Bar-Noy, and G. Kortsarz The minimum color sum of bipartite graphs J. Algorithms 28 1998 339 365
3. P. Erdös, E. Kubika, and A. Schwenk Graphs that require many colors to achieve their chromatic sum Congr. Numer. 71 1990 17 28
4. Z. Galil, S. Micali, and H. Gabow An O (EV log V) algorithm for finding a maximal weighted matching in general graphs SIAM J. Comput. 15 1986 120 130
5. M.R. Garey, and D.S. Johnson Computers and Interactability 1979 Freeman San Francisco
6. H. Hajiabolhassan, M.L. Mehrabadi, and R. Tusserkani Minimal coloring and strength of graphs Discrete Math. 215 2000 265 270
7. M.M. Halldórsson, G. Kortsarz, Multicoloring planar graphs and partial k-trees, in: Proceedings of the Second International Workshop on Approximation Algorithms, Springer, Berlin, 1999.
8. I. Holyer The NP-completeness of edge coloring SIAM J. Comput. 10 1981 718 720
9. K. Jansen, Complexity results for the optimum cost chromatic partition problem, preprint.
10. L.G. Kroon, A. Sen, H. Deng, A. Roy, The optimum cost chromatic partition problem for trees and interval graphs, in: International Workshop on Graph Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 1197, 1996, pp. 279-292.
11. E. Kubika, The chromatic sum of a graph, Ph.D. Thesis, Western Michigan University, 1989.
12. E. Kubika, A.J. Schwenk, An introduction to chromatic sums, in: Proceedings of the 17th Annual ACM Computer Science Conference, ACM Press, New York, 1989, pp. 39-45.
13. D. Leven, and Z. Galil NP-completeness of finding the chromatic index of regular graphs J. Algorithms 4 1983 35 44
14. M. Salavatipour, On sum coloring of graphs, M.Sc. Thesis, Department of Computer Science, University of Toronto, January 2000.
15. K.J. Supowit Finding a maximum planar subset of nets in a channel IEEE Trans. Comput. Aided Design CAD 6 1 1987 93 94
16. C. Thomassen, P. Erdös, Y. Alavi, P.J. Malde, and A.J. Schwenk Tight bounds on the chromatic sum of a connected graph J. Graph Theory 13 1989 353 357
17. M. Yannakakis Computing the minimum fill-in is NP-complete SIAM J. Algebraic Discrete Methods 2 1981 77 79
18. M. Yannakakis Node-deletion problems on bipartite graphs SIAM J. Comput. 10 1981 310 327
19. K. Jansen, Approximation results for the optimum cost chromatic partition problem, J. Algorithms 34 (2000) 54-89.
20. T. Jiang, D. West, Coloring of trees with minimum sum of colors, J. Graph Theory 32 (1999) 354-358.
21. K. Kubika, G. Kubika, D. Kountanis, Approximation algorithms for the chromatic sum, in: Proceedings of the First Great Lakes Computer Science Conference, Lecture Notes in Computer Science, Vol. 507, 1989, pp. 15-21.