To Prove Four Color Theorem

Details To Prove Four Color Theorem To Prove Four Color Theorem

2010-10-19

arxiv.org/abs/1010.4321v5

Mathematics

General Mathematics

In this version, the first part gives a proof to four color theorem which depends properties of planar graph. But by using res

Scientific paper

In this paper, we give a proof for four color theorem(four color conjecture). More important is that it does not involve computer assistance and can be generalized to prove Hadwiger Conjecture. Also an algorithm to color every planar graph using no more than 5 colors can be deduced from the proof. The newest part discusses outplanar graph and one kind of graph with interesting shape is discussed.

Affiliated with

Also associated with

No associations

Rating

To Prove Four Color Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with To Prove Four Color Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and To Prove Four Color Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-269973