On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes

Authors:
Eddie Cheng;Sven de Vries
Affiliations:
-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2002

Citing 0
Cited 2

Note: Facet-inducing web and antiweb inequalities for the graph coloring polytope

Discrete Applied Mathematics
On optimal k-fold colorings of webs and antiwebs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A large class of facets is constructed for the stable set polytope. This class is a common generalization of wheel facets and of antiweb facets. The proof of their validity and facetness exploits graph operations which transform inequalities into more complicated ones. In an accompanying paper polynomial time separation-algorithms are presented for generalizations of these inequalities.