七色定理的一个新证明  

A New Proof for Seven color Theorem

作　　者：冯佳昕[1] 

机构地区：[1]锦州师范学院电子工程系

出　　处：《辽宁大学学报（自然科学版）》1999年第1期18-20,共3页Journal of Liaoning University：Natural Sciences Edition

摘　　要：平面图Ｇ的完备色数是使得Ｇ的相邻或相关联的元素均染为不同色的最少颜色数．Ｋｒｏｎｋ和Ｍｉｔｃｈｅｍ证明了每一个最大度不超过３的平面图是７—完备可染的．The entire chromatic number of a plane graph G is the least number of colors which make the adjacent or incident G receive the same color. Kronk and Mitchem proved that each plane graph G with Δ(G)≤3 had 7 entire colorable. A short proof for this result was put forward with four color theorem.

关 键 词：平面图 完备色数 七色定理 

分 类 号：O157.5[理学—数学]