A pictorial proof of the Four Colour Theorem
General Mathematics
2021-10-20 v1
Abstract
We give a pictorial proof that transparently illustrates why four colours suffce to chromatically differentiate any set of contiguous, simply connected and bounded, planar spaces; by showing that there is no minimal planar map. We show, moreover, why the proof cannot be expressed within classical graph theory.
Cite
@article{arxiv.2110.09718,
title = {A pictorial proof of the Four Colour Theorem},
author = {Bhupinder Singh Anand},
journal= {arXiv preprint arXiv:2110.09718},
year = {2021}
}
Comments
6 pages