摘要
提出了一种证明"四色猜想"的新思路.证明了"四色猜想"的一部分,即不含K3的平面图最多是-4可着色的,指出了另一部分的证明思路.
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.
出处
《大学数学》
2004年第2期87-88,共2页
College Mathematics
关键词
正常着色
着色数
平面图
normal coloring
coloring number
plane figure
