E. Birmelé, R. A. Ferreira, R. Grossi, A. Marino, N. Pisanti et al., Optimal Listing of Cycles and st-Paths in Undirected Graphs, SODA 2013, pp.1884-1896, 2013.
DOI : 10.1137/1.9781611973105.134

Y. Chen and J. Flum, On Parameterized Path and Chordless Path Problems, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), pp.250-263, 2007.
DOI : 10.1109/CCC.2007.21
URL : http://basics.sjtu.edu.cn/~chen/papers/path.pdf

M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, Annals of Mathematics, vol.164, issue.1, pp.51-229, 2006.
DOI : 10.4007/annals.2006.164.51
URL : http://arxiv.org/abs/math/0212070

M. Conforti, G. Cornuéjols, A. Kapoor, and K. Vuskovic, Recognizing balanced 0, SODA 1994, pp.103-111, 1994.

M. Conforti, G. Cornuéjols, A. Kapoor, and K. Vuskovic, Finding an even hole in a graph, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.480-485, 1997.
DOI : 10.1109/SFCS.1997.646136

M. Conforti and M. R. Rao, Structural properties and decomposition of linear balanced matrices, Mathematical Programming, vol.10, issue.2, pp.129-168, 1992.
DOI : 10.1007/BF01581196

R. Haas and M. Hoffmann, Chordless paths through three vertices, Theoretical Computer Science, vol.351, issue.3, pp.360-371, 2006.
DOI : 10.1016/j.tcs.2005.10.021
URL : http://doi.org/10.1016/j.tcs.2005.10.021

M. Bruce, V. Kapron, B. King, and . Mountjoy, Dynamic graph connectivity in polylogarithmic worst case time, SODA, pp.1131-1142, 2013.

K. Kawarabayashi and Y. Kobayashi, The Induced Disjoint Paths Problem, Lecture Notes in Computer Science, vol.5035, pp.47-61, 2008.
DOI : 10.1007/978-3-540-68891-4_4

R. Read, E. Robert, and . Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks, vol.5, issue.3, p.237252, 1975.

D. Seinsche, On a property of the class of n-colorable graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.2, pp.191-193, 1974.
DOI : 10.1016/0095-8956(74)90063-X

N. Sokhn, R. Baltensperger, L. Bersier, J. Hennebert, and U. Ultes-nitsche, Identification of Chordless Cycles in Ecological Networks, COMPLEX, 2012.
DOI : 10.1016/0095-8956(85)90050-4

M. Maciej and . Syslo, An efficient cycle vector space algorithm for listing all cycles of a planar graph, SIAM J. Comput, vol.10, issue.4, pp.797-808, 1981.

T. Uno, Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs, ISAAC 1997, pp.92-101, 1997.
DOI : 10.1007/3-540-63890-3_11

T. Uno, An output linear time algorithm for enumerating chordless cycles, 92nd SIGAL of Information Processing Society Japan, pp.47-53, 2003.
DOI : 10.1007/978-3-319-11812-3_27
URL : http://arxiv.org/abs/1404.7610

M. Wild, Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion, Journal of Discrete Algorithms, vol.6, issue.1, pp.93-102, 2008.
DOI : 10.1016/j.jda.2007.01.005