Reexploring the upper bound for the chromatic number of graphs

被引:0
|
作者
LI Shuchao 1
2. Laboratory of Nonlinear Analysis
机构
关键词
chromatic number; clique number;
D O I
暂无
中图分类号
O157.5 [图论];
学科分类号
070104 ;
摘要
The upper bound of the chromatic number of simple graphs is explored. Its original idea comes from Coffman, Hakimi and Schmeichel, who recently studied the chromatic number of graphs with strong conditions. In this paper, corresponding conditions are weakened and the result proves that of Ershov and Kozhukhin’s.
引用
收藏
页码:84 / 86
页数:3
相关论文
共 50 条