Four color theorem

美 [fɔːr ˈkʌlər ˈθiːərəm]英 [fɔː(r) ˈkʌlə(r) ˈθɪərəm]

Four color theorem

1

By introducing maximal planar graph and the conjecture of four color , as well as analyzing the coloring of maximal planar graph , it is revealed that the coloring of maximal planar graph is the core of the four color theorem .

通过最大平面图和四色猜想的介绍及对最大平面图着色的分析，揭示了最大平面图着色是四色定理普遍证明的核心。
2

The Four Color Theorem and Algorithm of a Class of 4-Colorable Graph

一类可顶点4染色图的4染色定理及染色算法
3

Gives the four color theorem and algorithm of a class of 4-colorable graph , which is called ″ para-K-degree - grahp ″ ( K ≤ 3 ) of certain practical value .

提出了一类可顶点4染色图（即K≤3时的准度K图）的4染色定理及染色算法，其具有一定的实用价值。