Robert Berke ; Tibor Szabó
-
Relaxed Two-Coloring of Cubic Graphs
dmtcs:3445 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2005,
DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
-
https://doi.org/10.46298/dmtcs.3445
Relaxed Two-Coloring of Cubic GraphsConference paper
Authors: Robert Berke 1; Tibor Szabó 1
NULL##NULL
Robert Berke;Tibor Szabó
1 Department of Computer Science [ETH Zürich]
We show that any graph of maximum degree at most 3 has a two-coloring, such that one color-class is an independent set while the other color induces monochromatic components of order at most 189. On the other hand for any constant C we exhibit a 4-regular graph, such that the deletion of any independent set leaves at least one component of order greater than C. Similar results are obtained for coloring graphs of given maximum degree with k+ℓ colors such that k parts form an independent set and ℓ parts span components of order bounded by a constant. A lot of interesting questions remain open.
NATHAN LINIAL;JIŘÍ MATOUŠEK;OR SHEFFET;GÁBOR TARDOS, 2008, Graph Colouring with No Large Monochromatic Components, Combinatorics Probability Computing, 17, 4, pp. 577-589, 10.1017/s0963548308009140.