| 图的色数与着色数的上界 |
| |
| 引用本文： | 史小艺,张宁,薛婷婷. 图的色数与着色数的上界[J]. 五邑大学学报(自然科学版), 2012, 26(2): 15-17 |
| |
| 作者姓名： | 史小艺 张宁 薛婷婷 |
| |
| 作者单位： | 中国矿业大学理学院,江苏徐州,221116 |
| |
| 基金项目： | 中央高校基本科研业务费专项基金资助 |
| |
| 摘 要： | 证明了对于围长不少于2k1的图G,其色数X(G)≤c((bk,2k+1+2)n)1/k+1+2,其中c=c(k)且limk→∞ c(k)=1,bt,k是G的booksize.另外还证明了对于围长不少于2k+1的图G,其着色数σ(G)≤[bk,2k+1+1)n/2]1/k+2.
|
| 关 键 词： | 无向图 色数 着色数 围长 |
Bounds for Chromatic and Coloring Number of Graphs |
| |
| SHI Xiao-yi,ZHANG Ning,XUE Ting-ting. Bounds for Chromatic and Coloring Number of Graphs[J]. Journal of Wuyi University(Natural Science Edition), 2012, 26(2): 15-17 |
| |
| Authors: | SHI Xiao-yi ZHANG Ning XUE Ting-ting |
| |
| Affiliation: | (College of Sciences, China University of Mining and Technology, Xuzhou 221008, China) |
| |
| Abstract: | In this paper, it is proved that for graph G whose coloring number is X（G）≤c（（bk,2k＋1＋2）n）1/k＋1＋2 where c=c（k）with limk→∞ c（k）=1and whose girth is at least 2k＋1, bl.k is the booksize of G. It is also proved that the coloring number for graph G with girth at least 2k ＋1 is σ（G）≤[bk,2k＋1＋1）n/2]1/k＋2. |
| |
| Keywords: | undirected graph chromatic number coloring number girth |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
