Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Bar-Noy, A., Kortsarz, G.: The minimum color-sum of bipartite graphs. Journal of Algorithms 28, 339–365 (1998)
2. Halldórsson, M.M., Kortsarz, G.: Tools for multicoloring with applications to planar graphs and partial k-trees. Journal of Algorithms 42(2), 334–366 (2002)
3. Kovács, A.: Fast preemtive sum-multicoloring on paths. Extended version,
http://www.mpi-sb.mpg.de/~panni/pSMC_long.ps
4. Lecture Notes in Computer Science;A. Kovács,2004
5. Kubicka, E.: The Chromatic Sum of a Graph. PhD thesis, Western Michigan University (1989)