Gear composition and the stable set polytope

DOI10.1016/J.ORL.2008.01.003zbMATH Open1162.05356OpenAlexW2089330414MaRDI QIDQ1003487FDOQ1003487

Authors: A. Galluccio, Claudio Gentile, P. Ventura 

Publication date: 4 March 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.01.003

Recommendations

• Gear composition of stable set polytopes and \(\mathcal G\)-perfection
• On the Stable Set Polytope of Claw-Free Graphs
• The stable set polytope of claw-free graphs with large stability number
• Compositions of Graphs and Polyhedra II: Stable Sets
• Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs

zbMATH Keywords

polyhedral combinatoricsclaw-free graphsstable set polytopegraph composition

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Geometric algorithms and combinatorial optimization
• Properties of vertex packing and independence system polyhedra
• A class of facet producing graphs for vertex packing polyhedra
• On certain polytopes associated with graphs
• Claw-free graphs. VII. Quasi-line graphs
• On the facial structure of set packing polyhedra
• Maximum matching and a polyhedron with 0,1-vertices
• On maximal independent sets of vertices in claw-free graphs
• On stable set polyhedra for K//(1,3)free graphs
• The rank facets of the stable set polytope for claw-free 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
• The stable set polytope of quasi-line graphs
• Claw-free graphs. IV: Decomposition theorem
• On the stable set polytope of a series-parallel graph
• A strengthening of Ben Rebea's lemma
• Title not available (Why is that?)
• Further facet generating procedures for vertex packing polytopes
• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• Title not available (Why is that?)

Cited In (13)

• The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
• A new lifting theorem for vertex packing
• A new facet generating procedure for the stable set polytope
• Strengthened clique-family inequalities for the stable set polytope
• Separation routine and extended formulations for the stable set problem in claw-free graphs
• Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
• 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 claw-free graphs with large stability number
• Lovász-Schrijver PSD-operator on claw-free graphs
• Gear composition of stable set polytopes and \(\mathcal G\)-perfection
• 2-clique-bond of stable set polyhedra
• On the Stable Set Polytope of Claw-Free Graphs
• Claw-free graphs, skeletal graphs, and a stronger conjecture on \(\omega\), \(\Delta\), and \(\chi\)

This page was built for publication: Gear composition and the stable set polytope

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