We provide a complete linear description of the stable set polytope of geared (fuzzy) line graphs. This result gives a first substantial answer to the ...

Here, we provide an explicit linear description of the stable set polytope of claw-free graphs with stability number at least four and with no 1-join.

This result claims that clique, non-negativity and clique family inequalities are enough to characterize this polytope. It builds upon a recent decomposition ...

The stable set polytope, denoted by STAB ( G ) , is the convex hull of the incidence vectors of the stable sets of G. A linear system A x ⩽ b is said to be ...

Abstract. We define the class of geared (fuzzy) line graphs as the class of graphs obtained by repeated applications of the extended gear composition to a ...

Rank constraints suffice to describe STAB(G) for, e.g., perfect graphs. (Chvátal 1975), odd holes and odd antiholes, line graphs (Edmonds.

In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts ...

Obtaining a complete description of the stable set polytopes of claw-free graphs is a long-standing open problem. Eisenbrand et al. recently achieved a ...

Jan 18, 2024 · Abstract. The subject of this work is the study of LS+-perfect graphs defined as those graphs G for which the stable set polytope STAB(G) is ...

In this paper we give an explicit description of the stable set polytope of a claw-free graph obtained by repeated applications of the strip composition of ...