The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
From MaRDI portal
Publication:403365
DOI10.1016/j.jctb.2014.02.006zbMath1297.05196OpenAlexW2133251874MaRDI QIDQ403365
Anna Galluccio, Paolo Ventura, Claudio Gentile
Publication date: 29 August 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2014.02.006
Paths and cycles (05C38) Polytopes and polyhedra (52B99) Graph operations (line graphs, products, etc.) (05C76) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (8)
On the facets of stable set polytopes of circular interval graphs ⋮ The stable set polytope of icosahedral graphs ⋮ Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs ⋮ 2-clique-bond of stable set polyhedra ⋮ Separation routine and extended formulations for the stable set problem in claw-free graphs ⋮ The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect ⋮ Strengthened clique-family inequalities for the stable set polytope ⋮ Lovász-Schrijver PSD-Operator on Claw-Free Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
- Claw-free graphs. IV: Decomposition theorem
- The stable set polytope of quasi-line graphs
- Claw-free graphs. V. Global structure
- Gear composition and the stable set polytope
- Bull-free Berge graphs are perfect
- On the stable set polytope of a series-parallel graph
- On maximal independent sets of vertices in claw-free graphs
- The ellipsoid method and its consequences in combinatorial optimization
- On stable set polyhedra for K//(1,3)free graphs
- Geometric algorithms and combinatorial optimization
- Near-perfect matrices
- The rank facets of the stable set polytope for claw-free graphs
- On certain polytopes associated with graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
- 2-clique-bond of stable set polyhedra
- Gear Composition of Stable Set Polytopes and 𝒢-Perfection
- On facets of stable set polytopes of claw-free graphs with stability number three
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Properties of vertex packing and independence system polyhedra
- On the facial structure of set packing polyhedra
- Maximum matching and a polyhedron with 0,1-vertices
- Blocking and anti-blocking pairs of polyhedra
This page was built for publication: The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
