| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657113 | Journal of Combinatorial Theory, Series B | 2010 | 21 Pages |
Abstract
We prove that every graph with maximum degree Δ can be properly (Δ+1)-coloured so that no colour appears more than times in the neighbourhood of any vertex. This is best possible up to the constant multiple in the O(−) term.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
