The Four-color Conjecture

摘要：

The four-colors problem was formally brought up more than one hundred years ago. K. Apel and W. Haken of Illinois University had proved the question with computer. This proof made widely controversy, however the problem of non-computer proof is still suspend. This paper informed a sufficient condition of 4 _chromatic planar graph and proved that one of the planar graph G and the Dual of graph G is 4_chromati graph at least.

关键词： Planar graph Dual of graph K-chromaitc

作者: Zhou Haiyan Bai Xiaolin Qi Hui

作者单位: Faculty of Computer Engineering,Huaiyin Institute of Technology,Jiangsu, China Department of computer,Taiyuan Normal University,Taiyuan, China

会议类型: 国际会议

会议名称: 2010 International Conference on Computer and Communication Technologies in Agriculture Engineering(计算机与通信技术在农业工程国际会议 CCTAE 2010)

会议地点: 成都

会议语种:英文

页码: 224-227

在线出版日期: 2010-06-12（万方平台首次上网日期，不代表论文的发表时间）