Reexploring the upper bound for the chromatic number of graphs*
Shuchao Li, Jingzhong Mao · Progress in Natural Science Materials International · 2004
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.