The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect

DOI10.1016/j.jctb.2014.02.009zbMath1297.05198OpenAlexW2086648777MaRDI QIDQ740644

Paolo Ventura, Claudio Gentile, Anna Galluccio

Publication date: 4 September 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.009

zbMATH Keywords

stable set polytopehomogeneous setclaw-free graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedra and polytopes; regular figures, division of spaces (51M20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (9)

On the facets of stable set polytopes of circular interval graphs ⋮ The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect ⋮ 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 ⋮ Unnamed Item ⋮ Separation routine and extended formulations for the stable set problem in claw-free graphs ⋮ Strengthened clique-family inequalities for the stable set polytope ⋮ Lovász-Schrijver PSD-Operator on Claw-Free Graphs

Uses Software

• PORTA

Cites Work

• Unnamed Item
• Unnamed Item
• The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
• The stable set polytope of quasi-line graphs
• Claw-free graphs. V. Global structure
• Gear composition and the stable set polytope
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Geometric algorithms and combinatorial optimization
• 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.
• 2-clique-bond of stable set polyhedra
• Gear Composition of Stable Set Polytopes and 𝒢-Perfection
• The stable set polytope of claw-free graphs with stability number greater than three
• On the facial structure of set packing polyhedra
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect