“四色问题”的探索与论证
Probe and Demonstration of “Four-color Problem”
本文在图论已有的定义、公理、定理的基础上,证明“四色问题”。首先,对所需的基础理论进行了归纳总结,并逐一列出证明过程中需要的定义、公理及定理;其次,通过两种在极大平面图上增加新结点和连线的方法,证明任意极大平面图色数x(G)≤4;最后,通过在简单平面图增加点和连线构成极大平面图,证明了任意简单平面图的色数x(G)≤4,完成了“四色问题”的证明。
his paper based on the previous definition, axiom and theorem about graph theory to demonstrate the four-color problem. Firstly, I made a summary about the necessary theory, and listed all of the definition, axiom and theorem, which involved in the demonstration. Secondly, through two methods of adding vertex and line into maximal planar graph, to demonstrate that the chromatic number of every maximal planar graph is not bigger than four; Lastly, by adding vertex and line into planar graph to construct maximal planar graph, to demonstrate that the chromatic number of every planar graph is not bigger than four, then, completed the demonstration of the four-color problem.
肖开洲
数学
加点加线极大平面图圈平面图三角面色数
add vertexadd linemaximal planar graphcircleplanar graphtriangulationchromatic number
肖开洲.“四色问题”的探索与论证[EB/OL].(2008-10-22)[2025-08-02].http://www.paper.edu.cn/releasepaper/content/200810-529.点此复制
评论