The chromatic number of a graph G is the least number of colours that can be assigned to the vertices of G such that two adjacent vertices are assigned different colours. The clique number of a graph G is the size of the ...