A. Panconesi, A. Caprara, and R. Rizzi, Packing cycles in undirected graphs, Journal of Algorithms, vol.48, issue.1, pp.239-256, 2003.

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

L. Hans, F. V. Bodlaender, D. Fomin, E. Lokshtanov, S. Penninkx et al., (Meta) kernelization, Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.629-638, 2009.

[. 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

L. Hans, S. Bodlaender, A. Thomassé, and . Yeo, Kernel bounds for disjoint cycles and disjoint paths, Theoretical Computer Science, vol.412, issue.35, pp.4570-4578, 2011.

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

. Dimitris, J. Chatzidimitriou, I. Raymond, D. M. Sau, and . Thilikos, Minors in graphs of large ? r -girth, 1510.

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

[. 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?, O. , and L. Pósa, On independent circuits contained in a graph, Canadian Journal of Mathematics, vol.17, pp.347-352, 1965.

[. Fiorini, G. Joret, and U. Pietropaoli, Hitting Diamonds and Growing Cacti, Integer Programming and Combinatorial Optimization, pp.191-204, 2010.
DOI : 10.1007/978-3-642-13036-6_15

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

[. 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, D. Fomin, N. Lokshtanov, S. Misra, and . Saurabh, Planar F-deletion: Approximation, kernelization and optimal FPTalgorithms, IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), pp.470-479, 2012.

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. Hal91 and . Halin, Tree-partitions of infinite graphs, Discrete Mathematics, vol.97, issue.1 3, pp.203-217, 1991.

C. Joret, I. Paul, and . Sau, 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

[. Kawarabayashi and Y. Kobayashi, Edge-disjoint odd cycles in 4-edge-connected graphs, 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

N. Kakimura, K. Kawarabayashi, and Y. Kobayashi, Erd? ospó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.

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

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

Z. Krivelevich, M. R. Nutov, J. V. Salavatipour, R. Yuster, and . 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

[. 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.

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. 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

A. Bruce, N. Reed, P. D. Robertson, R. Seymour, and . Thomas, Packing directed circuits, Combinatorica, vol.16, issue.4, pp.535-554, 1996.

[. 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

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

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

R. Mohammad, J. Salavatipour, and . Verstraete, Disjoint cycles: Integrality gap, hardness, and approximation, Integer Programming and Combinatorial Optimization, pp.51-65, 2005.