Every Planar Map is Four Colorable 论文
1989Contemporary mathematics - American Mathematical Society引用 286
Computational Geometry and Mesh GenerationGraph Labeling and Dimension Problems
摘要
The following theorem is proved.THEOREM .Every planar map can be colored with at most four colors.