To Prove Four Color Theorem
General Mathematics
2017-01-03 v8
Abstract
In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and the most important is that it can be generalized to prove Hadwiger Conjecture. Moreover, we give algorithms to color and test planarity of planar graphs, which can be generalized to graphs containing minor. There are four parts of this paper: Part-1: To Prove Four Color Theorem Part-2: An Equivalent Statement of Hadwiger Conjecture when Part-3: A New Proof of Wagner's Equivalence Theorem Part-4: A Geometric View of Outerplanar Graph
Cite
@article{arxiv.1010.4321,
title = {To Prove Four Color Theorem},
author = {Weiya Yue and Weiwei Cao},
journal= {arXiv preprint arXiv:1010.4321},
year = {2017}
}
Comments
The paper is further reduced, and each part is more self-contained, is the final