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.
β¦ LIBER β¦
On cycles and the stable multi-set polytope
β Scribed by Arie M.C.A. Koster; Adrian Zymolka
- Book ID
- 108114339
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 203 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1572-5286
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Gear composition and the stable set poly
β
A. Galluccio; C. Gentile; P. Ventura
π
Article
π
2008
π
Elsevier Science
π
English
β 414 KB
Critical Facets of the Stable Set Polyto
β
LΓ‘szlΓ³ LiptΓ‘k; LΓ‘szlΓ³ LovΓ‘sz
π
Article
π
2001
π
Springer-Verlag
π
English
β 355 KB
Bounded Stable Sets: Polytopes and Color
β
Janssen, Jeannette; Kilakos, Kyriakos
π
Article
π
1999
π
Society for Industrial and Applied Mathematics
π
English
β 347 KB
Coloring planar Toeplitz graphs and the
β
Reinhardt Euler
π
Article
π
2004
π
Elsevier Science
π
English
β 290 KB
Cliques and odd cycles are well known to induce facet-deΓΏning inequalities for the stable set polytope. In graph coloring cliques are a class of n-critical graphs whereas odd cycles represent the class of 3-critical graphs. In the ΓΏrst part of this paper we generalize both notions to (Kn \ e)-cycles
On the stable set polytope of a series-p
β
A. R. Mahjoub
π
Article
π
1988
π
Springer-Verlag
π
English
β 204 KB
The stable set polytope of quasi-line gr
β
Friedrich Eisenbrand; Gianpaolo Oriolo; Gautier Stauffer; Paolo Ventura
π
Article
π
2008
π
Springer-Verlag
π
English
β 342 KB