Colouring a graph frugally


We prove that any graph with maximum degree Δ sufficiently large, has a proper vertex colouring using Δ+1 colours such that each colour class appears at most log8 Δ times in the neighbourhood of any vertex. We also show that for β≥1, the minimum number of colours required to colour any such graph so that each vertex appears at most β times in the neighbourhood of any vertex is θ(Δ+Δ1+1/β/β), showing in particular that when β=logΔ/loglogΔ, such a colouring cannot always be achieved with O(Δ) colours. We also provide a polynomial time algorithm to find such a colouring. This has applications to the total chromatic number of a graph.

This is a preview of subscription content, access via your institution.


  1. [1]

    N. Alon: A parallel algorithmic version of the Local Lemma,Random Structures and Algorithms,2 (1991), 367–378.

    Google Scholar 

  2. [2]

    J. Beck: An algorithmic approach to the Lovász Local Lemma,Random Structures and Algorithms,2 (1991), 343–365.

    Google Scholar 

  3. [3]

    P. Erdős andL. 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.

    Google Scholar 

  4. [4]

    W. Feller:An Introduction to Probability Theory and its Applications, Vol 1, Wiley (1966).

  5. [5]

    H. Hind, M. Molloy andB. Reed:Total colouring with Δ+poly(logΔ)colours, SIAM J. Comp. (to appear).

Download references

Author information



Additional information

The second two authors were supported by NATO Collaborative Research Grant #CRG950235.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Hind, H., Molloy, M. & Reed, B. Colouring a graph frugally. Combinatorica 17, 469–482 (1997).

Download citation

Mathematics Subject Classification (1991)

  • 05C15