A note on the strength and minimum color sum of bipartite graphs

The strength of a graph image is the smallest integer image such that there exists a minimum sum coloring of image using integers image, only. For bipartite graphs of maximum degree image we show the following simple bound: image. As a consequence, there exists a quadratic time algorithm for determining the strength and minimum color sum of bipartite graphs of maximum degree image.