Tight bounds on the chromatic sum of a connected graph

Carsten Thomassen, Paul Erdös, Yousef Alavi, Paresh J. Malde, Allen J. Schwenk
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