Graph homomorphisms and chromatic numbers are foundational concepts in modern graph theory, with widespread applications that extend from combinatorial optimisation to theoretical computer science.

Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence ...

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 ...