Sciweavers

Share
JCT
2010

Asymptotically optimal frugal colouring

9 years 9 months ago
Asymptotically optimal frugal colouring
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.
Michael Molloy, Bruce A. Reed
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where JCT
Authors Michael Molloy, Bruce A. Reed
Comments (0)
books