R. E. Aldred, S. Bau, D. A. Holton, and B. Mckay, Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs, Graphs and Combinatorics, vol.15, issue.4, pp.373-376, 1999.
DOI : 10.1007/s003730050046

S. Bau and D. Holton, Cycles containing 12 vertices in 3-connected cubic graphs, Journal of Graph Theory, vol.21, issue.4, pp.421-429, 1991.
DOI : 10.1002/jgt.3190150407

J. A. Bondy and L. Lovász, Cycles through specified vertices of a graph, Combinatorica, vol.22, issue.2, pp.117-140, 1981.
DOI : 10.1007/BF02579268

G. Dirac, In abstrakten Graphen vorhandene vollst??ndige 4-Graphen und ihre Unterteilungen, Mathematische Nachrichten, vol.2, issue.1-2, pp.61-85, 1960.
DOI : 10.1002/mana.19600220107

Y. Egawa, R. Glas, and S. C. Locke, Cycles and paths through specified vertices in k-connected graphs, Journal of Combinatorial Theory, Series B, vol.52, issue.1, pp.20-29, 1991.
DOI : 10.1016/0095-8956(91)90086-Y

M. N. Ellingham, D. A. Holton, and C. H. Little, Cycles through ten vertices in 3-connected cubic graphs, Combinatorica, vol.3, issue.4, pp.265-273, 1984.
DOI : 10.1007/BF02579136

S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science, vol.10, issue.2, pp.111-121, 1980.
DOI : 10.1016/0304-3975(80)90009-2

A. Frank and A. Schrijver, Edge-disjoint circuits in graphs on the torus, Journal of Combinatorial Theory, Series B, vol.55, issue.1, pp.9-17, 1992.
DOI : 10.1016/0095-8956(92)90029-W

F. Gringa, J. Harant, E. Hexel, and Z. , On short cycles through prescribed vertices of a graph, Discrete Mathematics, vol.286, issue.1-2, pp.67-74, 2004.
DOI : 10.1016/j.disc.2003.11.047

R. Häggkvist and C. Thomassen, Circuits through specified edges, Discrete Mathematics, vol.41, issue.1, pp.29-34, 1982.
DOI : 10.1016/0012-365X(82)90078-4

A. Jarry and S. Pérennes, Disjoint paths in symmetric digraphs, Discrete Applied Mathematics, vol.157, issue.1, pp.90-97, 2009.
DOI : 10.1016/j.dam.2008.04.024

R. M. Karp, On the complexity of combinatorial problems, pp.45-68, 1975.

K. Kawarabayashi, Cycles through a prescribed vertex set in N-connected graphs, Journal of Combinatorial Theory, Series B, vol.90, issue.2, pp.315-323, 2004.
DOI : 10.1016/j.jctb.2003.08.002

A. K. Kelmans and M. V. Lomonosov, When m vertices in a k-connected graph cannot be walked round along a simple cycle, Discrete Mathematics, vol.38, issue.2-3, pp.317-322, 1982.
DOI : 10.1016/0012-365X(82)90299-0

M. R. Kramer and J. Van-leeuwen, Wire-routing is NP-complete, 1982.

A. S. Lapaugh and R. L. Rivest, The subgraph homeomorphism problem, Journal of Computer and System Sciences, vol.20, issue.2, pp.133-149, 1980.
DOI : 10.1016/0022-0000(80)90057-4

L. Lovász, On some connectivity properties of Eulerian graphs, Acta Mathematica Academiae Scientiarum Hungaricae, vol.10, issue.1-2, pp.129-138, 1976.
DOI : 10.1007/BF01902503

N. Robertson and P. D. Seymour, Graph Minors .XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.65-110, 1995.
DOI : 10.1006/jctb.1995.1006
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson, P. D. Seymour, and R. Thomas, Quickly Excluding a Planar Graph, Journal of Combinatorial Theory, Series B, vol.62, issue.2, pp.323-348, 1994.
DOI : 10.1006/jctb.1994.1073