节点文献
基于k_n连接关系的图的着色问题与“折叠法”
"Folding Method" and Coloring of the Graphs Based on k_n Connecting Relations
【摘要】 引入了一类基于连接关系的图,并结合“折叠法”对该类图的着色问题与四色猜想进行了研究,给出了四色猜想的一个必要条件和一个等价命题的证明.最后提出了相关的猜想.
【Abstract】 This paper introduced the graphs based on k_n 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.
【基金】 湖南大学重点基金资助项目(521101802)
- 【文献出处】 湖南大学学报(自然科学版) ,Journal of Hunan University (Natural Science) , 编辑部邮箱 ,2005年04期
- 【分类号】O157.5
- 【下载频次】56