We are given an undirected, unweighted graph and a non-negative integer K.
- We must use at most K distinct colours to colour the vertices of the graph
- Each vertex is assigned only one colour
- We must colour the vertices of the graph such that any two vertices which are connected by an edge must have different colours