Paper , Order, or Assignment Requirements

The Five Colour Theorem

The famous four colour theorem is very difficult to prove.However there is a much simpler proof of the fact that any planar graph(without loops or multiple edges)has a vertex colouring with at most five colours. Explain the origin and a proof of this theorem.An additional challenge would be to address some aspects of the four colour theorem as well.