Four Colour Theorem

A constructive colouring of planar graphs

Every planar graph G satisfies χ(G) ≤ 4. This site gathers the working material for a constructive proof: interactive exhibits on the classical theorem and the structures met along the way, the writing that grew around the work, and a live map of the proof tree.

Interactive

Writing

Proof