The number of colours required to properly colour the vertices of every planer graph is

The four-colour theorem proves that every planar graph can be properly vertex-coloured with at most four colours. Planar K4 needs all four, proving that the least universal number required is exactly four, C. Five colours suffice but are not required; the recorded five-colour key is technically incorrect.