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
β¦ LIBER β¦
Bounded Stable Sets: Polytopes and Colorings
β Scribed by Janssen, Jeannette; Kilakos, Kyriakos
- Book ID
- 118198945
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1999
- Tongue
- English
- Weight
- 347 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0895-4801
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Coloring planar Toeplitz graphs and the
β
Reinhardt Euler
π
Article
π
2004
π
Elsevier Science
π
English
β 290 KB
Gear composition and the stable set poly
β
A. Galluccio; C. Gentile; P. Ventura
π
Article
π
2008
π
Elsevier Science
π
English
β 414 KB
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.
Polytope bounds on multivariate value se
β
Smith, Luke
π
Article
π
2014
π
Elsevier Science
π
English
β 226 KB
Maximum-weight stable sets and safe lowe
β
Stephan Held, William Cook, Edward C. Sewell
π
Article
π
2012
π
Springer-Verlag
π
English
β 252 KB
On cycles and the stable multi-set polyt
β
Arie M.C.A. Koster; Adrian Zymolka
π
Article
π
2005
π
Elsevier Science
π
English
β 203 KB
Critical Facets of the Stable Set Polyto
β
LΓ‘szlΓ³ LiptΓ‘k; LΓ‘szlΓ³ LovΓ‘sz
π
Article
π
2001
π
Springer-Verlag
π
English
β 355 KB