E. Birmelé, J. Bondy, and B. , Reed, Brambles, prisms and grids, Graph Theory in Paris, pp.37-44, 2007.

C. Chekuri and J. Chuzhoy, Large-treewidth graph decompositions and applications, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.291-300
DOI : 10.1145/2488608.2488645

URL : http://arxiv.org/abs/1304.1577

C. Chekuri and J. Chuzhoy, Polynomial bounds for the grid-minor theorem, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp.60-69

P. Erd?s and L. Pósa, On independent circuits contained in a graph, Canad, J. Math, vol.17, pp.347-352, 1965.

S. Fiorini, G. Joret, and I. Sau, Optimal Erd?s?Pósa property for pumpkins, Manuscript, 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

F. V. Fomin, D. Lokshtanov, N. Misra, G. Philip, and S. Saurabh, Quadratic Upper Bounds on the Erd??s-P??sa Property for a Generalization of Packing and Covering Cycles, Journal of Graph Theory, vol.21, issue.2, pp.417-424, 2013.
DOI : 10.1007/s004930100028

F. V. Fomin, S. Saurabh, and D. M. Thilikos, Strengthening Erd??s-P??sa property for minor-closed graph classes, Journal of Graph Theory, vol.21, issue.2, pp.235-240, 2011.
DOI : 10.1007/s004930100028

G. Joret, C. Paul, I. Sau, S. Saurabh, and S. Thomassé, Hitting and Harvesting Pumpkins, SIAM Journal on Discrete Mathematics, vol.28, issue.3, pp.1363-1390, 2014.
DOI : 10.1137/120883736

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

K. Kawarabayashi and Y. Kobayashi, Edge-disjoint odd cycles in 4-edge-connected graphs, 29th International Symposium on Theoretical Aspects of Computer Science, STACS, pp.206-217, 2012.
DOI : 10.1016/j.jctb.2015.12.002

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

A. Leaf and P. Seymour, Treewidth and planar minors, 2012.

J. Raymond and D. Thilikos, Polynomial gap extensions of the Erd??s-P??sa theorem, The Seventh European Conference on Combinatorics CRM Series, pp.13-18, 2013.
DOI : 10.1007/978-88-7642-475-5_3

J. Raymond and D. M. Thilikos, Low Polynomial Exclusion of Planar Graph Patterns, ArXiv e-prints, 2013.
DOI : 10.1002/jgt.22009

URL : http://arxiv.org/abs/1305.7112

B. A. Reed and D. R. Wood, Polynomial treewidth forces a large grid-like-minor, European Journal of Combinatorics, vol.33, issue.3, pp.374-379, 2012.
DOI : 10.1016/j.ejc.2011.09.004

URL : http://doi.org/10.1016/j.ejc.2011.09.004

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