Clique-circulants and the stable set polytope of fuzzy circular interval graphs

DOI10.1007/s10107-007-0176-7zbMath1176.90655OpenAlexW2167472512MaRDI QIDQ948961

Gianpaolo Oriolo, Gautier Stauffer

Publication date: 16 October 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2108/39100

zbMATH Keywords

stable set polytopecirculant graphsquasi-line graphsmatching polytope

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (7)

Facet-inducing web and antiweb inequalities for the graph coloring polytope ⋮ On the facets of stable set polytopes of circular interval graphs ⋮ On the facets of the stable set polytope of quasi-line graphs ⋮ Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ Unnamed Item ⋮ Almost all webs are not rank-perfect

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex hull of the edges of a graph and near bipartite graphs
• Matching theory
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• 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.
• Antiweb-wheel inequalities and their separation problems over the stable set polytopes
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
• Applying Lehman's theorems to packing problems
• Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• On the facial structure of set packing polyhedra
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Clique-circulants and the stable set polytope of fuzzy circular interval graphs