The list colouring constants

Journal of Graph Theory

Volumn 31, Issue 2, 1999, Pages 149-153

  Reed, Bruce ^a,b  

^a CNRS   (France)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Colouring; Graph

Indexed keywords

EID: 0001287032     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1097-0118(199906)31:2<149::aid-jgt8>3.0.co;2-%23     Document Type: Article

References (10)

1. J. A. Bondy and U. S. R. Murty, Graph theory and related topics, Academic, Toronto, 1979.
2. N. Alon, Strong chromatic number, Random Struct Algorithms 3 (1992), 1-7.
3. N. Alon, "Restricted colourings of graphs," Surveys in combinatorics, Proc 14th British Combin Conf, Cambridge Univ Press, Cambridge, 1993, pp. 1-33.
4. N. Alon and J. Spencer, The probabilistic method, Wiley, Toronto, 1992.
5. R. L. Brooks, On colouring the nodes of a network, Proc Cambridge Phil Soc 37 (1941), 194-197.
6. P. Erdos and L. Lovász, "Problems and results on 3-chromatic hypergraphs and some related questions," Infinite and finite sets, A. Hajnal et al. (Editors), Colloq Math Soc J Bolyai 11, North Holland, Amsterdam, 1975, pp. 609-627.
7. P. Erdos, A. Rubin, and H. Taylor, Choosability in graphs, Congr Num 26 (1979), 125-157.
8. T. Jensen and B. Toft, Graph coloring problems, Wiley, Toronto, 1995.
9. M. Molloy and B. Reed, Further algorithmic aspects of the local lemma, to appear.
10. V. Vizing, Colouring the vertices of a graph with prescribed colours, Diskret Analiz 29 (1976), 3-10.