Discrete Applied Mathematics
A dichotomy for minimum cost graph homomorphisms
European Journal of Combinatorics
Note: A note on the strength and minimum color sum of bipartite graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
A self-stabilizing algorithm for the minimum color sum of a graph
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Minimum cost homomorphisms to reflexive digraphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Minimum cost homomorphisms to oriented cycles with some loops
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Approximation of minimum cost homomorphisms
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
On the approximation of minimum cost homomorphism to bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
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. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 354–358, 1999