Colouring Planar Graphs With Three Colours and No Large Monochromatic Components
2014 ◽
Vol 23
(4)
◽
pp. 551-570
◽
We prove the existence of a function $f :\mathbb{N} \to \mathbb{N}$ such that the vertices of every planar graph with maximum degree Δ can be 3-coloured in such a way that each monochromatic component has at most f(Δ) vertices. This is best possible (the number of colours cannot be reduced and the dependence on the maximum degree cannot be avoided) and answers a question raised by Kleinberg, Motwani, Raghavan and Venkatasubramanian in 1997. Our result extends to graphs of bounded genus.
Keyword(s):
Keyword(s):
Keyword(s):
2018 ◽
Vol 10
(04)
◽
pp. 1850044
Keyword(s):
Keyword(s):
Keyword(s):