The Four-Color Theorem: On the Colouring of Maps by Arthur Cayley (in Proceedings of the Royal Geographical Society 1 No. 4 pp. 259–261, April 1879) WITH Every Planar Map is Four Colorable (in Bulletin of the American Mathematical Society 82 No. 5 pp. 711-712, September 1976) WITH Every Planar Map is Four Colorable Part I. Discharging and Every Planar Map is Four Colorable Part II. Reducibility by Kenneth Appel and Wolfgang Haken (in Illinois Journal of Mathematics 21 Issue 3 pp. 429 - 567, 1977) WITH The Four Colour Theorem by Neil Robertson et al. (in Journal of Combinatorial Theory B 70 No. 1 pp. 2-44, 1997); WITH Formal Proof - The Four Colour Theorem by Georges Gonthier (Notices of the American Mathematical Society 55 No. 11 pp. 382-393, December 2008) [ FIRST EDITIONS OF SIX PAPERS ON THE FOUR COLOR PROBLEM, THE FIRST MAJOR THEOREM TO BE PROVED USING A COMPUTER. INCLUDES THE 1st STATEMENT OF THE PROBLEM, ITS PROOF(S), & CONFIRMATION OF THE PROOF(S)
1st Edition. THE FOUR-COLOUR (Color) PROBLEM (OR THEOREM) IS “THE FIRST MAJOR THEOREM TO BE PROVED USING A COMPUTER” (Lamb, Having Fun with the 4-Color Theorem, Scientific American, March 1, 2013). Because the problem had “resisted the attempts of able mathematicians for over a century…when it was successfully proved in..... More