Clustered 3-colouring graphs of bounded degree
Keyword(s):
Abstract A (not necessarily proper) vertex colouring of a graph has clustering c if every monochromatic component has at most c vertices. We prove that planar graphs with maximum degree $\Delta$ are 3-colourable with clustering $O(\Delta^2)$ . The previous best bound was $O(\Delta^{37})$ . This result for planar graphs generalises to graphs that can be drawn on a surface of bounded Euler genus with a bounded number of crossings per edge. We then prove that graphs with maximum degree $\Delta$ that exclude a fixed minor are 3-colourable with clustering $O(\Delta^5)$ . The best previous bound for this result was exponential in $\Delta$ .
1996 ◽
Vol 5
(1)
◽
pp. 15-28
◽
2008 ◽
Vol 17
(2)
◽
pp. 265-270
◽
Keyword(s):
Keyword(s):
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
Keyword(s):
Keyword(s):
1999 ◽
Vol 31
(1)
◽
pp. 67-73
◽
2017 ◽
Vol 35
(1)
◽
pp. 1-13
◽