C. Bazgan, Z. Tuza, and D. Vanderpooten, Efficient algorithms for decomposing graphs under degree constraints, Discrete Applied Mathematics, vol.155, issue.8, pp.979-988, 2007.
DOI : 10.1016/j.dam.2006.10.005
URL : http://doi.org/10.1016/j.dam.2006.10.005

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. L. Bodlaender, S. Thomassé, and A. Yeo, Kernel bounds for disjoint cycles and disjoint paths, Theoretical Computer Science, vol.412, issue.35, pp.4570-4578, 2011.
DOI : 10.1016/j.tcs.2011.04.039
URL : https://hal.archives-ouvertes.fr/lirmm-00806805

A. Caprara, A. Panconesi, and R. Rizzi, Packing cycles in undirected graphs, Journal of Algorithms, vol.48, issue.1, pp.239-256, 2003.
DOI : 10.1016/S0196-6774(03)00052-X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.1027

D. Chatzidimitriou, J. Raymond, I. Sau, and D. M. Thilikos, -girth, European Journal of Combinatorics, vol.65
DOI : 10.1016/j.ejc.2017.04.011
URL : https://hal.archives-ouvertes.fr/hal-01218496

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, 2013.
DOI : 10.1145/2488608.2488645
URL : http://arxiv.org/abs/1304.1577

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

R. Diestel, K. Ichi-kawarabayashi, and P. Wollan, The Erd??s???P??sa property for clique minors in highly connected graphs, Journal of Combinatorial Theory, Series B, vol.102, issue.2, pp.454-469, 2012.
DOI : 10.1016/j.jctb.2011.08.001

G. Ding and B. Oporowski, On tree-partitions of graphs, Discrete Mathematics, vol.149, issue.1-3, pp.45-58, 1996.
DOI : 10.1016/0012-365X(94)00337-I

P. Erd?-os and L. Pósa, On independent circuits contained in a graph, Journal canadien de math??matiques, vol.17, issue.0, pp.347-352, 1965.
DOI : 10.4153/CJM-1965-035-8

S. Fiorini, G. Joret, and U. Pietropaoli, Hitting Diamonds and Growing Cacti, Proceedings of Integer Programming and Combinatorial Optimization, pp.191-204, 2010.
DOI : 10.1007/978-3-642-13036-6_15
URL : http://arxiv.org/abs/0911.4366

S. Fiorini, G. Joret, and I. Sau, Optimal Erd? os?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, and S. Saurabh, Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.470-479, 2012.
DOI : 10.1109/FOCS.2012.62
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7756

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

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

R. Halin, Tree-partitions of infinite graphs, Discrete Mathematics, vol.97, issue.1-3, pp.203-217, 1991.
DOI : 10.1016/0012-365X(91)90436-6

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

N. Kakimura, K. Kawarabayashi, and Y. Kobayashi, Erd? os?Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing, Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.1726-1736, 2012.
DOI : 10.1137/1.9781611973099.137
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.5430

K. Kawarabayashi and Y. Kobayashi, Edge-disjoint odd cycles in 4-edge-connected graphs, Procedings of the 29th International Symposium on Theoretical Aspects of Computer ScienceSTACS), pp.206-217, 2012.
DOI : 10.1016/j.jctb.2015.12.002
URL : https://hal.archives-ouvertes.fr/hal-00678188

K. Kawarabayashi and A. Nakamoto, The Erd??s???P??sa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces, Discrete Mathematics, vol.307, issue.6, pp.764-768, 2007.
DOI : 10.1016/j.disc.2006.07.008

T. Kloks, C. Lee, and J. Liu, New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs, Proceedings of Graph-Theoretic Concepts in Computer Science, pp.282-295, 2002.
DOI : 10.1007/3-540-36379-3_25

D. Král-' and H. Voss, Edge-disjoint odd cycles in planar graphs, Journal of Combinatorial Theory, Series B, vol.90, issue.1, pp.107-120, 2004.
DOI : 10.1016/S0095-8956(03)00078-9

M. Krivelevich, Z. Nutov, M. R. Salavatipour, J. V. Yuster, and R. Yuster, Approximation algorithms and hardness results for cycle packing problems, ACM Transactions on Algorithms, vol.3, issue.4, 2007.
DOI : 10.1145/1290672.1290685
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.4875

M. Krivelevich, Z. Nutov, and R. Yuster, Approximation algorithms for cycle packing problems, Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.556-561, 2005.

M. Pontecorvi and P. Wollan, Disjoint cycles intersecting a set of vertices, Journal of Combinatorial Theory, Series B, vol.102, issue.5, pp.1134-1141, 2012.
DOI : 10.1016/j.jctb.2012.05.004

D. Rautenbach and B. Reed, The Erd??s-P??sa Property for Odd Cycles in Highly Connected Graphs, Combinatorica, vol.21, issue.2, pp.267-278, 2001.
DOI : 10.1007/s004930100024

J. Raymond, I. Sau, and D. M. Thilikos, An edge variant of the Erd? os?Pósa property, p.1108, 1311.

J. Raymond and D. M. Thilikos, Recent results on the Erd? os?Pósa property, Discrete Appl. Math, 2017.

. Reed and A. Bruce, Tree Width and Tangles: A New Connectivity Measure and Some Applications, 1997.
DOI : 10.1017/CBO9780511662119.006

B. A. Reed, N. Robertson, P. D. Seymour, and R. Thomas, Packing directed circuits, Combinatorica, vol.2, issue.4, pp.535-554, 1996.
DOI : 10.1007/BF01271272
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.5838

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

M. R. Salavatipour and J. Verstraete, Disjoint Cycles: Integrality Gap, Hardness, and Approximation, Proceedings of Integer Programming and Combinatorial Optimization, pp.51-65, 2005.
DOI : 10.1007/11496915_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.3783

D. Seese, Tree-partite graphs and the complexity of algorithms, Proceedings of Fundamentals of Computation Theory, pp.412-421, 1985.
DOI : 10.1007/BFb0028825