A new proof of Grünbaumʹs 3 color theorem

A simple proof of Grünbaumʹs theorem on the 3-colourability of planar graphs having at most three 3-cycles is given, which does not employ the colouring extension.