Coloring of trees with minimum sum of colors

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199912)32:4<354::AID-JGT4>3.0.CO;2-B" /><354::AID-JGT4>3.0.CO;2-B 10.1002/(SICI)1097-0118(199912)32:4<354::AID-JGT4>3.0.CO;2-BzbMath0939.05037arXivmath/9904140OpenAlexW2141749671MaRDI QIDQ4719325

Tao Jiang, Douglas B. West

Publication date: 5 July 2000

Full work available at URL: https://arxiv.org/abs/math/9904140

zbMATH Keywords

treescoloringsmaximum vertex degreesum of colorschromatic sum

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Minimum cost homomorphism dichotomy for oriented cycles ⋮ A dichotomy for minimum cost graph homomorphisms ⋮ On the equality of the partial Grundy and upper ochromatic numbers of graphs ⋮ Total colorings of graphs with minimum sum of colors ⋮ A note on the strength and minimum color sum of bipartite graphs ⋮ The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops ⋮ Unnamed Item ⋮ A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph ⋮ Minimum Cost Homomorphisms to Reflexive Digraphs ⋮ Total chromatic sum for trees ⋮ Sum coloring and interval graphs: A tight upper bound for the minimum number of colors ⋮ Tabular graphs and chromatic sum

This page was built for publication: Coloring of trees with minimum sum of colors