On rank-perfect subclasses of near-bipartite graphs

Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet set reduces to rank constraints associated with single antiwebs by Wagler (2004b). We extend this result to a larger graph class, the complements of fuzzy circular interval graphs, recently introduced in Chudnovsky and Seymour (2004). Key words: Stable set polytope, rank constraints, antiwebs

• Type: Journal
• Year: 2005
• Where: 4OR
• Authors: Annegret Wagler
• Keywords: 4OR 2005, Fuzzy Circular Interval, Larger Graph Class, Stable Set Polytopes