| 不含K3的平面图最多是-4可着色的 |
| |
| 引用本文： | 任玉杰. 不含K3的平面图最多是-4可着色的[J]. 大学数学, 2004, 20(2): 87-88 |
| |
| 作者姓名： | 任玉杰 |
| |
| 作者单位： | 大连理工大学,应用数学系,辽宁,大连,116024 |
| |
| 摘 要： | 提出了一种证明"四色猜想"的新思路.证明了"四色猜想"的一部分,即不含K3的平面图最多是-4可着色的,指出了另一部分的证明思路.
|
| 关 键 词： | 正常着色 着色数 平面图 |
| 文章编号： | 1672-1454(2004)02-0087-02 |
| 修稿时间： | 2002-05-31 |
The Plane Figure that Does Not Contain K3 is Four Colorable at Most |
| |
| REN Yu-jie. The Plane Figure that Does Not Contain K3 is Four Colorable at Most[J]. College Mathematics, 2004, 20(2): 87-88 |
| |
| Authors: | REN Yu-jie |
| |
| Abstract: | New proof of Four-Color Conjecture is proposed. Part proof of them is given-the plane figure that does not contain K_3 is four (colorable) at most; Other proof thinking of them is suggested-the plane figure that contains K_3 is four (colorable) at most. |
| |
| Keywords: | normal coloring coloring number plane figure |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
