Abstract:A linear description of the stable set polytope STAB(G) of a quasi-line graph G is given in Eisenbrand et al. (Combinatorica 28(1):45–67, 2008), where the so called Ben Rebea Theorem (Oriolo in Discrete Appl Math 132(3):185–201, 2003) is proved. Such a theorem establishes that, for quasi-line graphs, STAB(G) is completely described by non-negativity constraints, clique inequalities, and clique family inequalities (CFIs). As quasi-line graphs are a superclass of line graphs, Ben Rebea Theorem can be seen as a g… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.