Abstract.
Shepherd95 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 Wagler2004. We extend this result to a larger graph class, the complements of fuzzy circular interval graphs, recently introduced in ChudnovskySeymour2004.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: November 2004 / Revised version: June 2005
Rights and permissions
About this article
Cite this article
Wagler, A.K. On rank-perfect subclasses of near-bipartite graphs. 4OR 3, 329–336 (2005). https://doi.org/10.1007/s10288-005-0077-7
Issue Date:
DOI: https://doi.org/10.1007/s10288-005-0077-7