Ultrametricity Transition in the Graph Colouring Problem

We study numerically the (planar) graph colouring problem with q colours. For q = 4, when a perfect colouring can be achieved, the solutions are scattered "r...