k-colourings problem (graphs)
programming
Statement
$k$-colourings problem (graphs)
Given an undirected graph $G = (V,E)$ and integer $k > 0$. Does $G$ have a proper vertex colouring using $k$-colours, if it does output the colouring and if not say so.