A New Method Based on Undirected Graph and Polygon Triangulation to Prove the Four-color Theorem

摘要

The development of computer science and plane geometry brings a new favorable opportunity for the research about the Four-color Theorem. After converting original map to undirected graph, this paper proposes a new method based on undirected graph and polygon triangulation to prove the Four-color Theorem.