E. Birmelé, J. A. Bondy, and B. A. Reed, The Erd??s???P??sa Property For Long Circuits, Combinatorica, vol.27, issue.2, pp.135-145, 2007.
DOI : 10.1007/s00493-007-0047-0

H. Bodlaender, F. Fomin, and D. Lokshtanov, Eelko Penninkx, Saket Saurabh, and Dimitrios Thilikos. (Meta) kernelization, 50th Annual IEEE Symposium on Foundations of Computer Science, 2009.

L. Hans, B. Bodlaender, and . Van-antwerpen-de-fluiter, Reduction algorithms for graphs of small treewidth, Inf. Comput, vol.167, pp.86-119, 2001.

R. B. Borie, R. G. Parker, and C. A. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica, vol.50, issue.1-6, pp.555-581, 1992.
DOI : 10.1007/BF01758777

R. Diestel, Graph Theory, volume 173 of Graduate Texts in Mathematics, 2005.

P. Erd?, O. , and L. Pósa, On independent circuits contained in a graph, Canadian Journal of Mathematics, vol.17, pp.347-352, 1965.

S. Fiorini, G. Joret, and I. Sau, Optimal Erd? os?Pósa property for pumpkins, 2013.

S. Fiorini, G. Joret, and D. R. Wood, Excluded Forest Minors and the Erd??s???P??sa Property, Combinatorics, Probability and Computing, vol.22, issue.05, pp.700-721, 2013.
DOI : 10.1007/978-3-642-23719-5

V. Fedor, S. Fomin, D. M. Saurabh, and . Thilikos, Strengthening Erd? os?Pósa property for minor-closed graph classes, Journal of Graph Theory, vol.66, issue.3, pp.235-240, 2011.

J. Geelen and K. Kabell, The Erd??s???P??sa property for matroid circuits, Journal of Combinatorial Theory, Series B, vol.99, issue.2, pp.407-419, 2009.
DOI : 10.1016/j.jctb.2008.08.004

URL : http://doi.org/10.1016/j.jctb.2008.08.004

G. Joret, C. Paul, I. Sau, S. Saurabh, and S. Thomassé, Hitting and harvesting pumpkins. ESA'11, 2011.
DOI : 10.1007/978-3-642-23719-5_34

URL : https://hal.archives-ouvertes.fr/lirmm-00642341

A. V. Kostochka, Lower bound of the hadwiger number of graphs by their average degree, Combinatorica, vol.7, issue.4, pp.307-316, 1984.
DOI : 10.1007/BF02579141

N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.92-114, 1986.
DOI : 10.1016/0095-8956(86)90030-4

URL : http://doi.org/10.1006/jctb.1999.1919

A. Thomason, The Extremal Function for Complete Minors, Journal of Combinatorial Theory, Series B, vol.81, issue.2, pp.318-338, 2001.
DOI : 10.1006/jctb.2000.2013

K. Yamazaki, H. L. Bodlaender, B. De-fluiter, and D. M. Thilikos, Isomorphism for Graphs of Bounded Distance Width, Algorithmica, vol.24, issue.2, pp.105-127, 1999.
DOI : 10.1007/PL00009273