Gear composition and the stable set polytope

Authors:
A. Galluccio;C. Gentile;P. Ventura
Affiliations:
Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti" - CNR, Viale Manzoni 30, 00185 Roma, Italy;Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti" - CNR, Viale Manzoni 30, 00185 Roma, Italy;Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti" - CNR, Viale Manzoni 30, 00185 Roma, Italy
Venue:
Operations Research Letters
Year:
2008

Citing 7
Cited 3

On the stable set polytope of a series-parallel graph

Mathematical Programming: Series A and B
A min-max relation for stable sets in graphs with no odd-K4

Journal of Combinatorial Theory Series B
A strengthening of Ben Rebea's lemma

Journal of Combinatorial Theory Series B
The rank facets of the stable set polytope for claw-free graphs

Journal of Combinatorial Theory Series B
Clique family inequalities for the stable set polytope of quasi-line graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
The stable set polytope of quasi-line graphs

Combinatorica
Claw-free graphs. IV. Decomposition theorem

Journal of Combinatorial Theory Series B

On the Stable Set Polytope of Claw-Free Graphs

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Gear Composition of Stable Set Polytopes and G-Perfection

Mathematics of Operations Research
2-clique-bond of stable set polyhedra

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new graph composition that produces a graph G from a given graph H and a fixed graph B called gear and we study its polyhedral properties. This composition yields counterexamples to a conjecture on the facial structure of STAB(G) when G is claw-free.