Relaxed Two-Coloring of Cubic Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Relaxed Two-Coloring of Cubic Graphs


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+ \ell$ colors such that $k$ parts form an independent set and $\ell$ parts span components of order bounded by a constant. A lot of interesting questions remain open.
Fichier principal
Vignette du fichier
dmAE0166.pdf (121.88 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184434 , version 1 (14-08-2015)



Robert Berke, Tibor Szabó. Relaxed Two-Coloring of Cubic Graphs. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.341-344, ⟨10.46298/dmtcs.3445⟩. ⟨hal-01184434⟩


68 View
502 Download



Gmail Facebook Twitter LinkedIn More