Gear composition and the stable set polytope

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. Key words: stable set polytope, graph composition, polyhedral combinatorics, claw-free graphs.

• Type: Journal
• Year: 2008
• Where: ORL
• Authors: Anna Galluccio, Claudio Gentile, Paolo Ventura
• Keywords: Fixed Graph, Graph Composition, ORL 2008, Stable Set Polytope