Relaxed two-coloring of cubic graphs

On decomposition of graphs

Péter L. Erdős, A. Hajnal · Acta Mathematica Academiae Scientiarum Hungaricae · 1967 · 171 citations

Computing, Computer Science, Mathematics +7

Partitioning into graphs with only small components

Noga Alon, Guoli Ding, Bogdan Oporowski et al. · Journal of Combinatorial Theory Series B · 2003 · 102 citations

Computing, Computer Science, Data Structures +8

Bounded size components—partitions and transversals

Penny Haxell, Tibor Szabó, Gábor Tardos · Journal of Combinatorial Theory Series B · 2003 · 57 citations

Natural Sciences, Computer Science, Mathematics +7

On linear k-arboricity

J Bermond, Jean‐Luc Fouquet, Michel Habib et al. · Discrete Mathematics · 1984 · 57 citations

Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5

Carsten Thomassen · Journal of Combinatorial Theory Series B · 1999 · 55 citations

Natural Sciences, Visualization, Combinatorics +8