A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Mathematical Proofs of Two Conjectures: The Four Color Problem and The Uniquely 4-colorable Planar Graph
[article]
2012
arXiv
pre-print
The famous four color theorem states that for all planar graphs, every vertex can be assigned one of 4 colors such that no two adjacent vertices receive the same color. Since Francis Guthrie first conjectured it in 1852, it is until 1976 with electronic computer that Appel and Haken first gave a proof by finding and verifying 1936 reducible unavoidable sets, and a simplified proof of Robertson, Sanders, Seymour and Thomas in 1997 only involved 633 reducible unavoidable sets, both proofs could
arXiv:0911.1587v3
fatcat:ifjdqgpvjnh7nlitqzr26p2hcq