Minimum number of different colours needed to colour all of the vertices in a graph so that two adjacent vertices are different colours.
The initial results of graph colouration concern planar graphs almost exclusively: it consists of colouring maps. Since the end of the 19th century, mathematicians have demonstrated that it only takes 4 colours to colour a geographical map.
Example
The chromatic number of the graphs below is 3:
