Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, and Hadas Shachnai. Sum multicoloring of graphs. J. Algorithms, 37(2):422–450, 2000.
2. Amotz Bar-Noy and Guy Kortsarz. Minimum color sum of bipartite graphs. J. Algorithms, 28(2):339–365, 1998.
3. Magnús M. Halldórsson and Guy Kortsarz. Multicoloring planar graphs and partial k-trees. In Randomization, approximation, and combinatorial optimization (Berkeley, CA, 1999), pages 73–84. Springer, Berlin, 1999.
4. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, and Jan Arne Telle. Multi-coloring trees. In Computing and combinatorics (Tokyo, 1999), pages 271–280. Springer, Berlin, 1999.
5. M. Hujter and Zs. Tuza. Precoloring extension. II. Graph classes related to bipartite graphs. Acta Mathematica Universitatis Comenianae, 62(1):1–11, 1993.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献