P. N. Balister, Packing closed trails into dense graphs, Journal of Combinatorial Theory, Series B, vol.88, issue.1, pp.107-118, 2003.
DOI : 10.1016/S0095-8956(02)00039-4

URL : http://doi.org/10.1016/s0095-8956(02)00039-4

D. Barth, O. Baudon, and J. Puech, Decomposable trees: a polynomial algorithm for tripodes, Discrete Applied Mathematics, vol.119, issue.3, pp.205-216, 2002.
DOI : 10.1016/S0166-218X(00)00322-X

URL : https://hal.archives-ouvertes.fr/hal-00307866

D. Barth and H. Fournier, A degree bound on decomposable trees, Discrete Mathematics, vol.306, issue.5, pp.469-477, 2006.
DOI : 10.1016/j.disc.2006.01.006

URL : https://hal.archives-ouvertes.fr/hal-00141015

O. Baudon, F. Gilbert, and M. Wo´zniakwo´zniak, Recursively arbitrarily vertex-decomposable suns, Opuscula Mathematica, vol.31, issue.4, pp.533-547, 2011.
DOI : 10.7494/OpMath.2011.31.4.533

URL : https://hal.archives-ouvertes.fr/hal-00512578

S. Cichacz, A. G?-orlich, A. Marczyk, J. Przyby-lo, and M. Wo´zniakwo´zniak, Arbitrarily vertex decomposable caterpillars with four or five leaves, Discussiones Mathematicae Graph Theory, vol.26, issue.2, pp.291-305, 2006.
DOI : 10.7151/dmgt.1321

E. Gy?-ori, On division of graphs to connected subgraphs, Colloq, Math. Soc. János Bolyai No. Combinatorics, vol.18, pp.485-494, 1976.

M. Hor?ák and M. Wo´zniakwo´zniak, Arbitrarily vertex decomposable trees are of maximum degree at most six, Opuscula Mathematica, vol.23, pp.49-62, 2003.

M. Hor?ák and M. Wo´zniakwo´zniak, Decomposition of complete bipartite even graphs into closed trails, Czechoslovak Math, J, vol.53, pp.127-134, 2003.

M. Hor?ák and M. Wo´zniakwo´zniak, On arbitrarily vertex decomposable trees, Discrete Math, pp.1268-1281, 2008.

M. Hor?ák, A. Marczyk, I. Schiermeyer, and M. Wo´zniakwo´zniak, Dense Arbitrarily Vertex Decomposable Graphs, Graphs and Combinatorics, vol.7, issue.6, pp.807-821, 2012.
DOI : 10.1007/s00373-011-1077-3

L. Lovász, A homology theory for spanning tress of a graph, Acta Mathematica Academiae Scientiarum Hungaricae, vol.30, issue.3-4, pp.241-251, 1977.
DOI : 10.1007/BF01896190

T. H. Miyano, T. Nishizeki, N. Takahashi, and S. Uneo, An algorithm for tripartitioning 3-connected graphs, pp.31-584, 1990.

S. Nakano, S. Rahman, and T. Nishizeki, A linear-time algorithm for four-partitioning four-connected planar graphs, Information Processing Letters, vol.62, issue.6, pp.315-322, 1997.
DOI : 10.1016/S0020-0190(97)00083-5

R. Ravaux, Decomposing trees with large diameter, Theoretical Computer Science, vol.411, issue.34-36, pp.3068-3072, 2010.
DOI : 10.1016/j.tcs.2010.04.032

URL : http://doi.org/10.1016/j.tcs.2010.04.032

H. Suzuki, N. Takahashi, and T. Nishizeki, A linear time algorithm for bipartition of biconnected graphs, Inform. Process. Lett, pp.33-227, 1990.