基于k_n连接关系的图的着色问题与“折叠法”  

"Folding Method" and Coloring of the Graphs Based on k_n Connecting Relations

作　　者：刘长荣[1] 

机构地区：[1]湖南大学数学与计量经济学院,湖南长沙410082

出　　处：《湖南大学学报（自然科学版）》2005年第4期121-124,共4页Journal of Hunan University:Natural Sciences

基　　金：湖南大学重点基金资助项目(521101802)

摘　　要：引入了一类基于连接关系的图,并结合“折叠法”对该类图的着色问题与四色猜想进行了研究,给出了四色猜想的一个必要条件和一个等价命题的证明.最后提出了相关的猜想.This paper introduced the graphs based on kn connecting relations, and studied the coloring of these graphs and FCC by using “folding method”. The proof of a necessary condition and an equivalent theorem of FCC was presented. Finally, the relative conjectures were presented.

关 键 词：折叠 着色 四色猜想 kn连接关系 

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