Back to Search Start Over

Reexploring the upper bound for the chromatic number of graphs.

Authors :
Li Shuchao
Mao Jingzhong
Source :
Progress in Natural Science. Mar2004, Vol. 14 Issue 3, p276-278. 3p.
Publication Year :
2004

Abstract

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. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
*GRAPHIC methods
*GRAPH theory
*ALGEBRA
*COMBINATORICS
*GEOMETRICAL drawing
*COLOR

Details

Language :
English
ISSN :
10020071
Volume :
14
Issue :
3
Database :
Academic Search Index
Journal :
Progress in Natural Science
Publication Type :
Academic Journal
Accession number :
13527712
Full Text :
https://doi.org/10.1080/10020070412331343461
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details