On the facets of the stable set polytope of quasi-line graphs

DOI10.1016/j.orl.2011.02.009zbMath1225.05209OpenAlexW1968424295MaRDI QIDQ635515

Gautier Stauffer

Publication date: 19 August 2011

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

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

zbMATH Keywords

stable set polytopefacetsquasi-line graphs

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Related Items

On the facets of stable set polytopes of circular interval graphs, A new lifting theorem for vertex packing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Claw-free graphs. III: Circular interval graphs
• Clique-circulants and the stable set polytope of fuzzy circular interval graphs
• The stable set polytope of quasi-line graphs
• On maximal independent sets of vertices in claw-free graphs
• On stable set polyhedra for K//(1,3)free graphs
• A class of facet producing graphs for vertex packing polyhedra
• 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.
• On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
• Almost all webs are not rank-perfect
• Lifting the facets of zero–one polytopes
• On the facial structure of set packing polyhedra
• Maximum matching and a polyhedron with 0,1-vertices