Colouring Diamond-free Graphs

Konrad K. Dabrowski, François Dross, Daniël Paulusma

The Colouring problem is that of deciding, given a graph $G$ and an integer $k$, whether $G$ admits a (proper) $k$-colouring. For all graphs $H$ up to five vertices, we classify th…