新疆师范大学学报（自然科学版）Issue(1)：22-24,3.
不含某些图作为导出子图的图的色数
On Chromatic Number of Graphs without Certain Induced Subgraphs
段芳1
作者信息
- 1. 新疆师范大学 数学科学学院，新疆 乌鲁木齐830054
- 折叠
摘要
Abstract
In general, there is no upper bound on the chromatic number of a graph in terms of its clique num⁃ber, since by a classical result of Erodo¨ swe know that the differenceχ( G) -ω( G) can be arbitrarily large. In this thesis, we shall focus on F -free graphs and obtain results that the chromatic number of F -free graphs has upper bound in terms of their clique number. LetG be a{K1,k+1 + e,C4,C4 + e} -free graph,ifα(G) ≥k≥3,thenχ( G) ≤( k( k - 1)/2)ω( G) .关键词
色数/团数/F-free 图Key words
Clique number/Chromatic number/F-free graph分类
数理科学引用本文复制引用
段芳..不含某些图作为导出子图的图的色数[J].新疆师范大学学报（自然科学版）,2015,(1):22-24,3.
