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

DOI

10.2991/iccsee.2013.494How to use a DOI?

Keywords

the Four-color Theorem, undirected graph, polygon triangulation

Abstract

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.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Geng Xue
AU  - Hui Liu
AU  - Shixian Li
AU  - Wei Chen
PY  - 2013/03
DA  - 2013/03
TI  - A New Method Based on Undirected Graph and Polygon Triangulation to Prove the Four-color Theorem
BT  - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
PB  - Atlantis Press
SP  - 1966
EP  - 1968
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccsee.2013.494
DO  - 10.2991/iccsee.2013.494
ID  - Xue2013/03
ER  -