On the stable set polytope of a series-parallel graph
From MaRDI portal
Publication:1106858
DOI10.1007/BF01580723zbMath0652.05029OpenAlexW2050692400MaRDI QIDQ1106858
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580723
Related Items
Arborescence polytopes for series-parallel graphs, Fractional and integral colourings, The Boolean quadratic polytope: Some characteristics, facets and relatives, On the complete set packing and set partitioning polytopes: properties and rank 1 facets, The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect, Non-Gorenstein locus and almost Gorenstein property of the Ehrhart ring of the stable set polytope of a cycle graph, On claw-free \(t\)-perfect graphs, Ideals of graph homomorphisms, On the facets of lift-and-project relaxations under graph operations, Circuit and bond polytopes on series-parallel graphs, Composition of stable set polyhedra, A min-max relation for stable sets in graphs with no odd-\(K_ 4\), Gear composition and the stable set polytope, On the facets of the lift-and-project relaxations of graph subdivisions, Characterising claw-free t-perfect graphs, On the Stable Set Polytope of Claw-Free Graphs, Set characterizations and convex extensions for geometric convex-hull proofs, The Steiner tree polytope and related polyhedra
Cites Work
