Coloring of Trees with Minimum Sum of Colors

Simple item page
dc.creatorJiang, Tao
dc.creatorWest, Douglas B.
dc.date1999-04-26
dc.date.accessioned2026-07-07T05:28:49Z
dc.date.available2026-07-07T05:28:49Z
dc.descriptionThe 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.
dc.description5 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/9904140
dc.identifierhttp://arxiv.org/abs/math/9904140
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78403
dc.subjectCombinatorics
dc.subject05C35; 05C55
dc.titleColoring of Trees with Minimum Sum of Colors
dc.typetext

Files

Collections

arXiv