The article describes briefly the history of graph colouring and the four-colour conjecture. The techique of 'discharging' is demonstrated in two examples.
We also show an unusual proof of the five-colourability of planar graphs.