Showing math.COShow all
2 papers · 1 filter
math.CO1999
Coloring of Trees with Minimum Sum of Colors
Tao Jiang, Douglas B. West
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 chrom…
math.CO1999
Edge-bandwidth of graphs
Tao Jiang, Dhruv Mubayi, Aditya Shastri +1
The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that…