Sciweavers

Share
4OR
2005

On rank-perfect subclasses of near-bipartite graphs

8 years 7 months ago
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
Annegret Wagler
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2005
Where 4OR
Authors Annegret Wagler
Comments (0)
books