1 search results - page 1 / 1 » Asymptotically optimal frugal colouring |
JCT
2010
13 years 3 months ago
2010
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 v...