Colourings with Bounded Monochromatic Components in Graphs of Given Circumference

From MaRDI portal
(Redirected from Publication:4595652)



Abstract: We prove that every graph with circumference at most k is O(logk)-colourable such that every monochromatic component has size at most O(k). The O(logk) bound on the number of colours is best possible, even in the setting of colourings with bounded monochromatic degree.












This page was built for publication: Colourings with Bounded Monochromatic Components in Graphs of Given Circumference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595652)