3.7.106. Graph colouring

A constraint that can be used for the graph colouring problem. The graph colouring problem is to colour with a restricted number of colours the vertices of a given undirected graph in such a way that adjacent vertices are coloured with distinct colours.