An Analytic Proof of Four Color Problem
An analytical proof of the Four Color Conjecture has been described in this article. Kempes chain argument and Heawoods technique to prove ‘Five color theorem’ has been exploited. Success has come through the searching of special triangles, around a vertex of degree 5, for three recursions. This proof stands on the principle of mathematical induction, so requires no computer assistance.
Maximal Planar Graph; K5; K3,3; Bigraph; Kempe’s chain; Bichain; Representative triangle
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.
JOS ©: World Science Publisher United States