Coloring of trees with minimum sum of colors

被引：0
|
作者：
Jiang, T [1 ]
West, DB [1 ]
机构：
[1] Univ Illinois, Urbana, IL 61801 USA
来源：
JOURNAL OF GRAPH THEORY | 1999年 / 32卷 / 04期
关键词：
chromatic sum; minimal coloring; strength;
D O I：
10.1002/(SICI)1097-0118(199912)32:4<354::AID-JGT4>3.0.CO;2-B
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The chromatic sum od a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength is the minimum number of colors needed to achieve the chromatic sum. We construct for each positive integer k: a tree with strength k that has maximum degree only 2k - 2. The result is best possible. (C) 1999 John Wiley & Sons, Inc. J Graph Theory 32: 354-358, 1999.
引用
下载
收藏
页码：354 / 358
页数：5
相关论文
共 50 条
  • [21] An Effective Ant Colony Optimization Algorithm for the Minimum Sum Coloring Problem
    Douiri, Sidi Mohamed
    Elbernoussi, Souad
    COMPUTATIONAL COLLECTIVE INTELLIGENCE: TECHNOLOGIES AND APPLICATIONS, 2013, 8083 : 346 - 355
  • [22] A short proof of the NP-completeness of minimum sum interval coloring
    Marx, D
    OPERATIONS RESEARCH LETTERS, 2005, 33 (04) : 382 - 384
  • [23] Minimum sum multicoloring on the edges of trees - (Extended abstract)
    Marx, D
    APPROXIMATION AND ONLINE ALGORITHMS, 2004, 2909 : 214 - 226
  • [24] Minimum sum coloring for large graphs with extraction and backward expansion search
    Wu, Qinghua
    Zhou, Qing
    Jin, Yan
    Hao, Jin-Kao
    APPLIED SOFT COMPUTING, 2018, 62 : 1056 - 1065
  • [25] Minimum sum multicoloring on the edges of trees (extended abstract)
    Marx, Dániel
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 2909 : 214 - 226
  • [26] The edge coloring game on trees with the number of colors greater than the game chromatic index
    Fong, Wai Lam
    Chan, Wai Hong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (02) : 456 - 480
  • [27] The edge coloring game on trees with the number of colors greater than the game chromatic index
    Wai Lam Fong
    Wai Hong Chan
    Journal of Combinatorial Optimization, 2019, 38 : 456 - 480
  • [28] Solving the Minimum Sum Coloring Problem: Alternative Models, Exact Solvers, and Metaheuristics
    Du, Yu
    Glover, Fred
    Kochenberger, Gary
    Hennig, Rick
    Wang, Haibo
    Hulandageri, Amit
    INFORMS JOURNAL ON COMPUTING, 2024,
  • [29] A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem
    Mrad, Mehdi
    Harrabi, Olfa
    Siala, Jouhaina Chaouachi
    Gharbi, Anis
    IEEE ACCESS, 2020, 8 : 57891 - 57904
  • [30] A fast local search algorithm for minimum sum coloring problem on massive graphs
    Li, Yan
    Zhao, Mengyu
    Zhang, Xindi
    Wang, Yiyuan
    COMPUTERS & OPERATIONS RESEARCH, 2024, 172
12345