Relaxed two-coloring of cubic graphs

• Autores: Robert Berke, Tibor Szabó
• Localización: Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 97, Nº. 4, 2007, págs. 652-668
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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-class induces monochromatic components of order at most 750. 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+e] colors such that k parts form an independent set and e parts span components of order bounded by a constant. A lot of interesting questions remain open.