For a graph G, the maximum number of colours needed so that all regions touching one another (meeting at an edge or a vertex) are in a different colour is the chromatic number, denoted by χ‎(G). The Four Colour Theorem proved that χ‎(G)≤4 for all planar graphs.