New upper bounds for the chromatic number of a graph

Journal of Graph Theory

Volumn 36, Issue 2, 2001, Pages 117-120

  Stacho, Ladislav ^a,b  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Chromatic number; Degree of a vertex; Simple graph

Indexed keywords

EID: 23044523309     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0118(200102)36:2<117::AID-JGT6>3.0.CO;2-7     Document Type: Article

References (7)

1. R. L. Brooks, On colouring the nodes of a network, Proc Cambridge Phil Soc 37 (1941), 194-197.
2. O. V. Borodin and A. V. Kostochka, On an upper bound of a graph's chromatic number, depending on the graph's degree and density, J Combin Theory B 23 (1977), 247-250.
3. P. A. Catlin, A bound on the chromatic number of a graph, Discrete Math 22 (1978), 81-83.
4. M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Computer Sci 1 (1976), 237-267.
5. J. H. Kim, On Brook's theorem for sparse graphs, Combin Probab Comput 4 (1995), 97-132.
6. A. V. Kostochka, A modification of a Catlin's algorithm, Methods and Programs of Solutions Optimization Problems on Graphs and Networks 2 (1982), 75-79 (in Russian).
7. J. Lawrence, Covering the vertex set of a graph with subgraphs of smaller degree, Discrete Math 2 (1978), 61-68.