A. Caprara and R. Rizzi, Packing triangles in bounded degree graphs, Information Processing Letters, vol.84, issue.4, pp.175-180, 2002.
DOI : 10.1016/S0020-0190(02)00274-0

K. Corradi and A. Hajnal, On the maximal number of independent circuits in a graph, Acta Mathematica Academiae Scientiarum Hungaricae, vol.14, issue.3-4, pp.423-439, 1963.
DOI : 10.1007/BF01895727

J. Degenhardt and P. Recht, On a relation between the cycle packing number and the cyclomatic number of a graph, p.manuscript, 2008.

Y. Egawa, R. J. Faudree, E. Gy?-ori, Y. Ishigami, R. H. Schelp et al., Vertex-disjoint cycles containing specified edges, Graphs Comb, pp.16-81, 2000.

Y. Egawa, M. Hagita, K. Kawarabayashi, and H. Wang, Covering vertices of a graph by k disjoint cycles, Discrete Math, pp.115-125, 2003.

Y. Egawa, H. Enomoto, S. Jendrol-', and K. , Ota, and I. Schiermeyer, Independence number and vertex-disjoint cycles, Discrete Math, pp.1493-1498, 2007.

H. Enomoto, On the Existence of Disjoint Cycles in a Graph, Combinatorica, vol.18, issue.4, pp.487-492, 1998.
DOI : 10.1007/s004930050034

P. Erd?-os and L. Pósa, On the maximal number of disjoint circuits of a graph, Publ. Math. Debrecen, vol.9, pp.3-12, 1962.

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

Z. Friggstad and M. R. Salavatipour, Approximability of Packing Disjoint Cycles, Proceedings of ISAAC 2007, pp.304-315, 2007.
DOI : 10.1007/978-3-540-77120-3_28

S. Fujita, Recent Results on Disjoint Cycles in Graphs, Electronic Notes in Discrete Mathematics, vol.22, pp.409-412, 2005.
DOI : 10.1016/j.endm.2005.06.067

J. Harant, D. Rautenbach, F. Regen, and P. Recht, Packing edge-disjoint cycles in graphs and the cyclomatic number, Discrete Mathematics, vol.310, issue.9, pp.310-1456, 2010.
DOI : 10.1016/j.disc.2009.07.017

D. Rautenbach and F. Regen, On packing shortest cycles in graphs, Information Processing Letters, vol.109, issue.14, pp.816-821, 2009.
DOI : 10.1016/j.ipl.2009.04.001

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

A. Schrijver, Combinatorial Optimization Polyhedra and Efficiency, 2004.

R. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

J. Verstraëte, Vertex-disjoint cycles of the same length, Journal of Combinatorial Theory, Series B, vol.88, issue.1, pp.45-52, 2003.
DOI : 10.1016/S0095-8956(02)00012-6

J. Verstraëte, A Note on Vertex-Disjoint Cycles, Combinatorics, Probability and Computing, vol.11, issue.01, pp.97-102, 2002.
DOI : 10.1017/S0963548301004904

H. Wang, Large vertex-disjoint cycles in a bipartite graph, Graphs Comb, pp.359-366, 2000.

H. Wang, On independent cycles in a bipartite graph, Graphs Comb, pp.177-183, 2001.

H. Wang, Maximal Total Length Of k Disjoint Cycles In Bipartite Graphs, Combinatorica, vol.25, issue.3, pp.367-377, 2005.
DOI : 10.1007/s00493-005-0021-7

H. Whitney, Non-separable and planar graphs, Transactions of the American Mathematical Society, vol.34, issue.2, pp.339-362, 1932.
DOI : 10.1090/S0002-9947-1932-1501641-2
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1076008