| 两类2连通(n,n+4)图的色唯一性 |
| |
| 引用本文： | 王建丰,刘儒英,冶成福.两类2连通(n,n+4)图的色唯一性[J].东北师大学报(自然科学版),2008,40(4). |
| |
| 作者姓名： | 王建丰 刘儒英 冶成福 |
| |
| 作者单位： | 1. 青海师范大学数学与信息科学系,青海,西宁,810008;新疆大学数学与系统科学学院,新疆,乌鲁木齐,830046
2. 青海师范大学数学与信息科学系,青海,西宁,810008 |
| |
| 摘 要： | 2连通的(n,n 4)图是有n个顶点n 4条边的连通图,利用图的色多项式理论研究了两类2连通的(n,n 4)图的色性,由此部分或完全解决了图G5和图G12的色唯一性问题.
|
| 关 键 词： | 2连通图 色多项式 色唯一性 |
Chromatic uniqueness of two kinds of 2-connected (n,n+4)-graphs |
| |
| WANG Jian-feng,LIU Ru-ying,YE Cheng-fu.Chromatic uniqueness of two kinds of 2-connected (n,n+4)-graphs[J].Journal of Northeast Normal University (Natural Science Edition),2008,40(4). |
| |
| Authors: | WANG Jian-feng LIU Ru-ying YE Cheng-fu |
| |
| Abstract: | 2-connected(n,n 4) graphs are the connected graphs with order n and size n 4.By the theory of chromatic polynomials of graphs,the chromaticity of two classes of 2-connected(n,n 4) graphs are studied.Then the chromatic uniqueness of graphs G5 and G12 is partially and completely solved,respectively. |
| |
| Keywords: | 2-connected graphs chromatic polynomial chromatic uniqueness |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
