New lower bounds on the weighted chromatic number of a graph

Massimiliano Caramia, Jirí Fiala
2004 Discussiones Mathematicae Graph Theory  
In this paper we present theoretical and algorithmic results for the computation of lower bounds on the chromatic number of a weighted graph. In particular, we study different ways of a possible improvement of the lower bound offered by a maximum weighted clique. Based on our findings we devise new algorithms and show their performance on random graphs.
doi:10.7151/dmgt.1224 fatcat:aaezufu6pfgtxgip4hbevljvey