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 achieved in one iteration of Lovász–Schrijver PSD …

Gear composition and the stable set polytope - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …

Fuzzy antihat graphs are graphs obtained as 2-clique-bond compositions of fuzzy line
graphs with three different types of three-cliqued graphs. By the decomposition theorem of …

Fuzzy circular interval graphs are a generalization of proper circular arc graphs and have
been recently introduced by Chudnovsky and Seymour as a fundamental subclass of claw …

Abstract In [6], Edmonds provided the first complete description of the polyhedron associated
with a combinatorial optimization problem: the matching polytope. As the matching problem …

Graphs obtained by applying the gear composition to a given graph H are called geared
graphs. We show how a linear description of the stable set polytope STAB (G) of a geared …

Clique-node and closed neighborhood matrices of circular interval graphs are circular
matrices. The stable set polytope and the dominating set polytope on these graphs are …

In this contribution we continue the study of the Lovász-Schrijver PSD-operator applied to
the edge relaxation of the stable set polytope of a graph. The problem of obtaining a …

Stable set problems subsume matching problems since a matching is a stable set in a so-
called line graph but stable set problems are hard in general while matching can be solved …

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 breakthrough for the subclass …