Partitioning into graphs with only small components

On decomposition of graphs

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

Network Science, Graph Theory, Engineering +7

The linear arboricity of graphs

Noga Alon · Israel Journal of Mathematics · 1988 · 141 citations

Graph Theory, Algebraic Graph Theory, Structural Graph Theory +5

Excluding any graph as a minor allows a low tree-width 2-coloring

Matt DeVos, Guoli Ding, Bogdan Oporowski et al. · Journal of Combinatorial Theory Series B · 2004 · 108 citations

Graph Minor, Graph Theory, Algebraic Graph Theory +4

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

Graph Minor, Monochromatic Component, Geometric Graph Theory +7

On tree-partitions of graphs

Guoli Ding, Bogdan Oporowski · Discrete Mathematics · 1996 · 45 citations

Graph Theory, Algebraic Graph Theory, Structural Graph Theory +5