Blueprint for a Classic Proof of the Four Colour Theorem

Patrick Labarque

The proof uses the property that the vertices of a triangulated planar graph can be four coloured if the triangles can have a +1 or -1 orientation so that the sum of the triangle o…