Colouring a Graph
Task: Colour a graph.
Working of JesseΒΆ
The graph colouring problem is straightforward: For a graph, defined as a collection of edges and vertices, we must assign a colour to each node so that no two adjacent nodes have the same colour. More often than not and depending on how many colours we're allowed to use, there are multiple possible solutions to this. Essentially once we have one viable solution, the remainder are a game of combinatorics.
The minimum number of colours requires to colour a graph is called it's chromatic number.