arXiv:2208.10936 [math.CO]AbstractReferencesReviewsResources
Another Proof of the Four Colour Theorem -- Part 2 -- Discharging a minimal 5-Chromatic Planar Graph
Published 2022-08-16Version 1
In RSST, they "replace the mammoth hand-checking of unavoidability that A&H required, by another mammoth hand-checkable proof " (page 18). Here, the proof of unavoidability is accomplished in a lengthy structured hand-checkable proof whose entirety is presented in this document.
Comments: 60 pages, 18 Figures, 7 Appendices, containing all exhaustive enumerations in < 500 cases
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:0909.3286 [math.CO] (Published 2009-09-17)
O-cycles, vertex-oriented graphs, and the four colour theore
arXiv:1706.08581 [math.CO] (Published 2017-06-26)
Treewidth Bounds for Planar Graphs Using Three-Sided Brambles
arXiv:1508.06892 [math.CO] (Published 2015-08-27)
On the Hamiltonian Number of a Planar Graph