两类2连通的(n,n+4)图的色性的判定  

The Judgment of Chromaticity of 2-connected (n,n+4)-graphs

作　　者：杨金梅[1] 

机构地区：[1]青海师范大学数学系,青海西宁810008

出　　处：《大理学院学报（综合版）》2009年第4期1-4,共4页Journal of Dali University

摘　　要：文献〔5〕和〔6〕分别研究了(n,n+2)图和(n,n+3)图的色性,并得到了一些色唯一图。研究了两类2连通的(n,n+4)图,并给出了其色不唯一的证明。The chromaticity of （n,n＋2）-graphs and （n,n＋3）-graphs in the reference [5] and [6] was studied, and some chromatically unique graphs obtained. This paper mainly presented two kinds of 2-connected （n,n＋4）-graphs and their proof of chromatic non-uniqueness.

关 键 词：图 色多项式 度序列 

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