At first sight, there seem to be a great variety of types of claw-free graphs. For instance, there
are line graphs, the graph of the icosahedron, complements of triangle-free graphs, and the …

It is a long standing open problem to find an explicit description of the stable set polytope of
claw-free graphs. Yet more than 20 years after the discovery of a polynomial algorithm for …

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 …

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 engaged during those last …

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 …

Graphs with circular symmetry, called webs, are crucial for describing the stable set
polytopes of two larger graph classes, quasi-line graphs [8, 12] and claw-free graphs [7, 8] …

It is a long standing open problem to find an explicit description of the stable set polytope of
claw-free graphs. Yet more than 20 years after the discovery of a polynomial algorithm for …

The stable set polytope is a fundamental object in combinatorial optimization. Among the
many valid inequalities that are known for it, the clique-family inequalities play an important …

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 …

In this paper, we give a complete and explicit description of the rank facets of the stable set
polytope for a class of claw-free graphs, recently introduced by Chudnovsky and Seymour …