The stable set polytope of icosahedral graphs

DOI10.1016/j.disc.2015.09.028zbMath1327.05078OpenAlexW2153320815MaRDI QIDQ898118

Anna Galluccio, Claudio Gentile

Publication date: 8 December 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.09.028

zbMATH Keywords

stable set polytopeclaw-free graphsicosahedron

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

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 claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
• The stable set polytope of quasi-line graphs
• Claw-free graphs. V. Global structure
• On stable set polyhedra for K//(1,3)free graphs
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Geometric algorithms and combinatorial optimization
• Near-perfect matrices
• 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
• Gear Composition of Stable Set Polytopes and 𝒢-Perfection
• On facets of stable set polytopes of claw-free graphs with stability number three
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• 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 icosahedral graphs