A construction for non-rank facets of stable set polytopes of webs

DOI10.1016/j.ejc.2006.06.013zbMath1102.90053OpenAlexW2627607892MaRDI QIDQ852709

Annegret K. Wagler, Arnaud Pêcher

Publication date: 15 November 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.06.013

zbMATH Keywords

combinatorial optimizationgraphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (5)

Facet-inducing web and antiweb inequalities for the graph coloring polytope ⋮ Unnamed Item ⋮ On the set covering polyhedron of circulant matrices ⋮ A new lifting theorem for vertex packing ⋮ Almost all webs are not rank-perfect

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
• The strong perfect graph theorem
• Graphical properties related to minimal imperfection
• 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
• 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
• Antiwebs are rank-perfect
• On non-rank facets of stable set polytopes of webs with clique number four
• Almost all webs are not rank-perfect
• Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
• Stable Set Polytopes for a Class of Circulant Graphs
• Perfect zero–one matrices
• On the strong perfect graph conjecture

This page was built for publication: A construction for non-rank facets of stable set polytopes of webs