The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect

DOI10.1016/J.JCTB.2014.02.009MaRDI QIDQ740644zbMATH OpenOpenAlexFDO

Authors A. Galluccio, Claudio Gentile, P. Ventura

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

claw-free graphsstable set polytopehomogeneous set

Mathematics Subject Classification ID

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

Recommendations

• The stable set polytope of claw-free graphs with stability number greater than three
• The stable set polytope of claw-free graphs with large stability number
• On the Stable Set Polytope of Claw-Free Graphs
• The stable set polytope of icosahedral graphs
• Generalized clique family inequalities for claw-free graphs

Cites work

• scientific article; zbMATH DE number 3862930 (Why is no real title available?)
• 2-clique-bond of stable set polyhedra
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Claw-free graphs. V. Global structure
• Clique family inequalities for the stable set polytope of quasi-line graphs.
• Gear composition and the stable set polytope
• Gear composition of stable set polytopes and \(\mathcal G\)-perfection
• Geometric algorithms and combinatorial optimization
• Maximum matching and a polyhedron with 0,1-vertices
• On certain polytopes associated with graphs
• On the facial structure of set packing polyhedra
• The rank facets of the stable set polytope for claw-free 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 claw-free graphs with stability number greater than three
• The stable set polytope of quasi-line graphs
• The structure of claw-free graphs

Cited in

(16)

• The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
• Strengthened clique-family inequalities for the stable set polytope
• Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures
• Separation routine and extended formulations for the stable set problem in claw-free graphs
• On facets of stable set polytopes of claw-free graphs with stability number 3
• Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
• The stable set polytope of claw-free graphs with large stability number
• The stable set polytope of claw-free graphs with stability number greater than three
• Lovász-Schrijver PSD-operator on claw-free graphs
• Gear composition of stable set polytopes and \(\mathcal G\)-perfection
• The stable set polytope for some extensions of \(P_4\)-free graphs
• 2-clique-bond of stable set polyhedra
• The stable set polytope of icosahedral graphs
• Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
• On the Stable Set Polytope of Claw-Free Graphs
• On the facets of stable set polytopes of circular interval graphs

Describes a project that uses

Uses Software

• PORTA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740644)