Proof of the Four-color Problem
首发时间:2007-07-16
Abstract:This paper consists of two sections. The first part previously proves a particular case and then a general case. By comparing sharply, the essence of the four-color problem is displayed. The second part points out the weakness in the planar graph of Heawood’s counter example and also its types by GR graph. It also offers a new type of counter example so as to replace the former one. In the end, it is stated that the way of proving the four-color problem according to Kempe is not likely to be successful by analyzing the phenomenon of dynamic balance.
keywords: four-color problem;Heawood’s counter example; GR graph;dynamic balance
点击查看论文中文信息
基金:
论文图表:
引用
No.1405533887118457****
同行评议
共计0人参与
勘误表
Proof of the Four-color Problem
评论
全部评论0/1000