Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs

DOI10.1016/j.disc.2007.01.010zbMath1126.90077OpenAlexW2054385878MaRDI QIDQ2461195

Raffaele Mosca, Caterina De Simone

Publication date: 27 November 2007

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

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

zbMATH Keywords

stable set polytopeclique polytopesubstitutiondefining linear system

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

2-clique-bond of stable set polyhedra ⋮ The stable set polytope for some extensions of \(P_4\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On algorithms for (\(P_5\), gem)-free graphs
• On minimal imperfect graphs without induced \(P_5\)
• On certain polytopes associated with graphs
• On the structure of (\(P_{5}\),\,gem)-free graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)