A seminal review of the b-chromatic number and related topics further consolidates these advances, emphasising important theoretical results and their potential computational challenges [3].

The chromatic number problem, which is the problem of finding the chromatic number of any graph, is a particular case of the chromatic scheduling problem. Two algorithms, basic and look-ahead, are ...

Dimitris Achlioptas, Assaf Naor, The Two Possible Values of the Chromatic Number of a Random Graph, Annals of Mathematics, Second Series, Vol. 162, No. 3 (Nov., 2005), pp. 1335-1351 ...