Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1143059 | Operations Research Letters | 2008 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
A. Galluccio, C. Gentile, P. Ventura,