Add to ORKGInternational audienceGraphs with circular symmetry, called webs, are relevant for describing the stable set polytopes of two larger graph classes, quasi-line graphs and claw-free graphs. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem. However, even the problem of finding all facets of stable set polytopes of webs is open. So far, it is only known that stable set polytopes of webs with clique number ≤ 3 have rank facets only while there are examples with clique number > 4 having non-rank facets. The aim of the present paper is to treat the remaining case with clique number =4: we provide an infinite sequence of such webs whose stable set polytopes admit non-rank facet
In this paper we study lift-and-project polyhedral operators defined by Lovász and Schrijver and Bal...
Abstract Fuzzy antihat graphs are graphs obtained as 2-clique-bond compositions of fuzzy line graphs...
We study the stable set polytope P (Gn ) for the graph Gn with n nodes and edges [i, j] when |i-j| ...
AbstractGraphs with circular symmetry, called webs, are relevant for describing the stable set polyt...
Graphs with circular symmetry, called webs, are relevant for describing the stable set polytopes of ...
AbstractGraphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set po...
International audienceGraphs with circular symmetry, called webs, are crucial for describing the sta...
We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend results of Gi...
AbstractThis paper provides a complete characterization of the rank facets of the stable set polytop...
A construction for non-rank facets of stable set polytopes of webs 1Laboratoire Bordelais de Recherc...
AbstractObtaining a complete description of the stable set polytopes of claw-free graphs is a long-s...
AbstractFor some graph classes defined by forbidding one-vertex extensions of the P4, we introduce a...
Stampato marzo 1994Consiglio Nazionale delle Ricerche (CNR). Biblioteca Centrale / CNR - Consiglio N...
In this paper, we give a complete and explicit description of the rank facets of the stable set poly...
It, is a long standing open problem to find an explicit description of the stable set polytope of cl...
In this paper we study lift-and-project polyhedral operators defined by Lovász and Schrijver and Bal...
Abstract Fuzzy antihat graphs are graphs obtained as 2-clique-bond compositions of fuzzy line graphs...
We study the stable set polytope P (Gn ) for the graph Gn with n nodes and edges [i, j] when |i-j| ...
AbstractGraphs with circular symmetry, called webs, are relevant for describing the stable set polyt...
Graphs with circular symmetry, called webs, are relevant for describing the stable set polytopes of ...
AbstractGraphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set po...
International audienceGraphs with circular symmetry, called webs, are crucial for describing the sta...
We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend results of Gi...
AbstractThis paper provides a complete characterization of the rank facets of the stable set polytop...
A construction for non-rank facets of stable set polytopes of webs 1Laboratoire Bordelais de Recherc...
AbstractObtaining a complete description of the stable set polytopes of claw-free graphs is a long-s...
AbstractFor some graph classes defined by forbidding one-vertex extensions of the P4, we introduce a...
Stampato marzo 1994Consiglio Nazionale delle Ricerche (CNR). Biblioteca Centrale / CNR - Consiglio N...
In this paper, we give a complete and explicit description of the rank facets of the stable set poly...
It, is a long standing open problem to find an explicit description of the stable set polytope of cl...
In this paper we study lift-and-project polyhedral operators defined by Lovász and Schrijver and Bal...
Abstract Fuzzy antihat graphs are graphs obtained as 2-clique-bond compositions of fuzzy line graphs...
We study the stable set polytope P (Gn ) for the graph Gn with n nodes and edges [i, j] when |i-j| ...