Combinatorics and Graph Theory

   

Try to re-Prove 4-Color Theorem

Authors: Oh Jung Uk

The point of inside closed curve could not directly connect to the point of outside. If a point of outside closed curve directly connect to points on closed curve then the maximum number of color of map is 4 under only 3 conditions, and the end point of closed curve is located inside newly created closed curve. If another outside point is added then we could prevent maximum color from exceeding 4 by using to rearrange colors of existing points.

Comments: 8 Pages.

Download: PDF

Submission history

[v1] 2014-08-07 22:36:44

Unique-IP document downloads: 80 times

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus