Publisher
Springer Berlin Heidelberg
Reference9 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.: Sum-multicoloring on paths. Research Report MPI-I-2003-1-015, Max- Planck-Institut für Informatik (July 2003)
4. Kubicka, E.: The Chromatic Sum of a Graph. PhD thesis, Western Michigan University (1989)
5. Lecture Notes in Computer Science;D. Marx,2002
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献