Clique-connecting forest and stable set polytopes

DOI10.1051/ro/2010005zbMath1221.05132OpenAlexW2000961588MaRDI QIDQ5189884

Denis Cornaz

Publication date: 11 March 2010

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/44707

zbMATH Keywords

graphpolytopeseparationfacet

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Boolean programming (90C09) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Facet-inducing web and antiweb inequalities for the graph coloring polytope ⋮ On co-bicliques

Cites Work

• Cliques, holes and the vertex coloring polytope
• The ellipsoid method and its consequences in combinatorial optimization
• Wheel inequalities for stable set polytopes
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A one-to-one correspondence between colorings and stable sets
• Fractional covers for forests and matchings
• Selected Applications of Minimum Cuts in Networks
• On the facial structure of set packing polyhedra
• Maximum matching and a polyhedron with 0,1-vertices
• A Selection Problem of Shared Fixed Costs and Network Flows
• Matroids and the greedy algorithm

This page was built for publication: Clique-connecting forest and stable set polytopes