A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Tight bounds on the chromatic sum of a connected graph
1989
Journal of Graph Theory
The chromatic sum of a graph is introduced in the dissertation of Ewa Kubicka. It is the smallest possible total among all proper colorings of G using natural numbers. In this article we determine tight bounds on the chromatic sum of a connected graph with e edges,
doi:10.1002/jgt.3190130310
fatcat:rrkc277lt5bm3hte2wld426ita