Title of article
Asymptotically optimal frugal colouring
Author/Authors
Molloy، نويسنده , , Michael and Reed، نويسنده , , Bruce، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
21
From page
226
To page
246
Abstract
We prove that every graph with maximum degree Δ can be properly ( Δ + 1 ) -coloured so that no colour appears more than O ( log Δ / log log Δ ) times in the neighbourhood of any vertex. This is best possible up to the constant multiple in the O ( − ) term.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2010
Journal title
Journal of Combinatorial Theory Series B
Record number
1528027
Link To Document