Colouring a graph frugally

Combinatorica

Volumn 17, Issue 4, 1997, Pages 469-482

  Hind, Hugh ^a   Molloy, Michael ^b   Reed, Bruce ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

^c CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040516852     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01195001     Document Type: Article

References (5)

1. N. ALON: A parallel algorithmic version of the Local Lemma, Random Structures and Algorithms, 2 (1991), 367-378.
2. J. BECK: An algorithmic approach to the Lovász Local Lemma, Random Structures and Algorithms, 2 (1991), 343-365.
3. P. ERDOS and L. LOVÁSZ: Problems and results on 3-chromatic hypergraphs and some related questions, in: "Infinite and Finite Sets" (A. Hajnal et. al. eds.), Colloq. Math. Soc. J. Bolyai 11, North Holland, Amsterdam, 1975, pp. 609-627.
4. W. FELLER: An Introduction to Probability Theory and its Applications, Vol 1, Wiley (1966).
5. H. HIND, M. MOLLOY and B. REED: Total colouring with Δ+poly(logΔ) colours, SIAM J. Comp. (to appear).