On the feedback vertex set polytope of a series–parallel graph

Reed, 2002, Algorithmic aspects of tree width, 85 Arnborg, 1991, Easy problems for tree-decomposable graphs, J. Algorithms, 12, 308, 10.1016/0196-6774(91)90006-K Courcelle, 1990, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Inform. and Comput., 85, 12, 10.1016/0890-5401(90)90043-H Sbihi, 1980, Algorithme de recherche d’un stable de cardinalité maximum dans un graphe sans étoile, Discrete Math., 29, 53, 10.1016/0012-365X(90)90287-R Lovász, 1986 Minty, 1980, On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory, 28, 284, 10.1016/0095-8956(80)90074-X Nakamura, 2001, A revision of Minty’s algorithm for finding a maximum weighted stable set of a claw-free graph, J. Oper. Res. Soc. Japan, 44, 194 Galluccio, 1997, The rank facets of the stable set polytope for claw-free graphs, J. Combin. Theory Ser. B, 69, 1, 10.1006/jctb.1996.1715 Oriolo, 2003, Clique family inequalities for the stable set polytope of quasi-line graphs, Discrete Appl. Math., 132, 185, 10.1016/S0166-218X(03)00400-1 Eisenbrand, 2005, Circular ones matrices and the stable set polytope of quasi-line graphs, vol. 3509, 291 Conforti, 2004, On the cut polyhedron, Discrete Math., 277, 279, 10.1016/j.disc.2002.12.001 Ding, 2002, Packing cycles in graphs, J. Combin. Theory Ser. B, 86, 381, 10.1006/jctb.2002.2134 Cunningham, 1978, A primal algorithm for optimum matching, Math. Program. Stud., 8, 50, 10.1007/BFb0121194 Schrijver, 2003, Combinatorial Optimization: Polyhedra and Efficiency, vol. 24 Sebö, 1988, The Schrijver system of odd join polyhedra, Combinatorica, 8, 103, 10.1007/BF02122558 Gerards, 1989, A min–max relation for stable sets in graphs with no odd-K4, J. Combin. Theory Ser. B, 47, 330, 10.1016/0095-8956(89)90032-4 Sewell, 1993, Stability critical graphs and even subdivisions of K4, J. Combin. Theory Ser. B, 59, 74, 10.1006/jctb.1993.1055 Sewell, 1995, Stability critical graphs and rank facets of the stable set polytope, Discrete Math., 147, 247, 10.1016/0012-365X(94)00168-I Fleiner, 1997, Covering a symmetric poset with symmetric chains, Combinatorica, 17, 339, 10.1007/BF01215916 Schrijver, 1986, Theory of linear and integer programming Goemans, 1994, The Steiner tree polytope and related polyhedra, Math. Program., 63, 157, 10.1007/BF01582064 Margot, 1994, Tree polytopes on 2-trees, Math. Program., 63, 183, 10.1007/BF01582065 Barahona, 1994, Compositions of graph and polyhedra I: balanced induced subgraphs and acyclic subgraphs, SIAM J. Discrete Math., 7, 344, 10.1137/S0895480190182666 Gerards, 1986, Matrices with the Edmonds–Johnson property, Combinatorica, 6, 365, 10.1007/BF02579262 Brunetta, 2000, Solving the feedback vertex set problem on undirected graphs, Discrete Applied Mathematics, 101, 37, 10.1016/S0166-218X(99)00180-8 Bafna, 1995, vol. 1004, 142 Chudak, 1998, A primal–dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs, Oper. Res. Lett., 22, 111, 10.1016/S0167-6377(98)00021-2