Coloring of Trees with Minimum Sum of Colors
Abstract
Description
The chromatic sum of 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.
5 pages, 1 figure
5 pages, 1 figure