N. Alon, G. Ding, B. Oporowski, and D. Vertigan, Partitioning into graphs with only small components, Journal of Combinatorial Theory, Series B, vol.87, issue.2, pp.231-243, 2003.
DOI : 10.1016/S0095-8956(02)00006-0

P. Erd?-os and H. Sachs, Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.Natur. Reihe, vol.12, pp.251-257, 1963.

P. Haxell, T. Szabó, and G. Tardos, Bounded size components???partitions and transversals, Journal of Combinatorial Theory, Series B, vol.88, issue.2, pp.281-297, 2003.
DOI : 10.1016/S0095-8956(03)00031-5

B. Jackson and N. Wormald, On the linear k-arboricity of cubic graphs, Discrete Math, pp.293-297, 1996.

L. Lovász, On decomposition of graphs, Stud. Sci. Math. Hung, vol.1, pp.237-238, 1966.

C. Thomassen, Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5, Journal of Combinatorial Theory, Series B, vol.75, issue.1, pp.100-109, 1999.
DOI : 10.1006/jctb.1998.1868