On non-rank facets of stable set polytopes of webs with clique number four

DOI10.1016/j.dam.2005.05.042zbMath1131.90078OpenAlexW2016072885MaRDI QIDQ2492218

Arnaud Pêcher, Annegret K. Wagler

Publication date: 9 June 2006

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

Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.042

zbMATH Keywords

stable set polytopeweb(non-)rank facetrank-perfect graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

A construction for non-rank facets of stable set polytopes of webs ⋮ Almost all webs are not rank-perfect

Cites Work

• On stable set polyhedra for K//(1,3)free graphs
• Geometric algorithms and combinatorial optimization
• A class of facet producing graphs for vertex packing polyhedra
• Near-perfect matrices
• The rank facets of the stable set polytope for claw-free graphs
• On certain polytopes associated with graphs
• Rank-perfect and weakly rank-perfect 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
• Stable Set Polytopes for a Class of Circulant Graphs
• Perfect zero–one matrices
• On the strong perfect graph conjecture
• Unnamed Item
• Unnamed Item

This page was built for publication: On non-rank facets of stable set polytopes of webs with clique number four