M. Ba¨?ouba¨?ou and A. R. Mahjoub, Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs, SIAM Journal on Discrete Mathematics, vol.10, issue.3, pp.505-514, 1997.
DOI : 10.1137/S0895480193259813

E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, Discrete Applied Mathematics, vol.89, issue.1-3, pp.1-44, 1998.
DOI : 10.1016/S0166-218X(98)00136-X

E. Balas, Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems, SIAM Journal on Algebraic Discrete Methods, vol.6, issue.3, pp.466-486, 1985.
DOI : 10.1137/0606047

P. Bauer, The Circuit Polytope: Facets, Mathematics of Operations Research, vol.22, issue.1, pp.110-145, 1997.
DOI : 10.1287/moor.22.1.110

P. Bauer, J. T. Linderoth, and M. W. Savelsbergh, A branch and cut approach to the cardinality constrained circuit problem, Mathematical Programming, vol.91, issue.2, pp.91-307, 2002.
DOI : 10.1007/s101070100209

A. Chakrabarti, L. Fleischer, and C. , When the cut condition is enough, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.19-26, 2012.
DOI : 10.1145/2213977.2213980

S. Chopra, The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs, SIAM Journal on Discrete Mathematics, vol.7, issue.1, pp.16-31, 1994.
DOI : 10.1137/S0895480191199415

M. Conforti, G. Cornuéjols, and G. Zambelli, Extended formulations in combinatorial optimization, Annals of Operations Research, vol.43, issue.1, pp.97-143, 2013.
DOI : 10.1007/978-1-4613-8431-1

G. Cornuéjols, J. Fonlupt, and D. Naddef, The traveling salesman problem on a graph and some related integer polyhedra, Mathematical Programming, vol.13, issue.1, pp.1-27, 1985.
DOI : 10.1007/BF01582008

C. R. Coullard and W. R. Pulleyblank, On cycle cones and polyhedra, Linear Algebra and its Applications, pp.114-115, 1989.

M. D. Biha and A. R. , k-edge connected polyhedra on series-parallel graphs, Operations Research Letters, vol.19, issue.2, pp.71-78, 1996.
DOI : 10.1016/0167-6377(96)00015-6

R. J. Duffin, Topology of series-parallel networks, Journal of Mathematical Analysis and Applications, vol.10, issue.2, pp.303-318, 1965.
DOI : 10.1016/0022-247X(65)90125-3

D. Eppstein, Parallel recognition of series-parallel graphs, Information and Computation, vol.98, issue.1, pp.41-55, 1992.
DOI : 10.1016/0890-5401(92)90041-D

J. B. Fourier, Solution d'une questionparticulì ere du calcul des inégalités, Nouveau bulletin des sciences par la société philomatique de Paris (1826), pp.317-319

M. R. Garey, D. S. Johnson, and R. E. Tarjan, The Planar Hamiltonian Circuit Problem is NP-Complete, SIAM Journal on Computing, vol.5, issue.4, pp.704-714, 1976.
DOI : 10.1137/0205049

V. Kaibel and R. Stephan, On cardinality constrained cycle and path polytopes, Mathematical Programming, vol.8, issue.2, pp.371-394, 2010.
DOI : 10.1002/9781118627372

R. , K. Martin, R. L. Rardin, and B. A. Campbell, Polyhedral Characterization of Discrete Dynamic Programming, Operations Research, pp.38-127, 1990.

A. R. Mahjoub, On the stable set polytope of a series-parallel graph, Mathematical Programming, vol.51, issue.1-3, pp.53-57, 1988.
DOI : 10.1007/BF01580723

V. H. Nguyen and J. Maurras, On the linear description of the 3-cycle polytope, European Journal of Operational Research, vol.13, issue.2, pp.310-325, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01149464

V. H. Nguyen and J. Maurras, On the Linear Description of the k-cycle Polytope, International Transactions in Operational Research, vol.8, issue.6, pp.673-692, 2001.
DOI : 10.1111/1475-3995.t01-1-00331
URL : https://hal.archives-ouvertes.fr/hal-01149566

T. Rothvoß, The matching polytope has exponential extension complexity, Computing Research Repository, 2013.

P. D. Seymour, Sums of circuits, in Graph Theory and Related Topics, pp.341-355, 1979.