# Vertex Colouring

Given an undirected graph a $G = (V,E)$ a vertex colouring using $D$ is a map $c: V \rightarrow D$. Whilst you can use a generic domain $D$ normally people talk about $k$-colourings, this is where $D = \{1,2, \ldots, k\}$.