Stable Set Polytopes for a Class of Circulant Graphs
From MaRDI portal
Publication:4702296
DOI10.1137/S1052623497321973zbMath0953.90051MaRDI QIDQ4702296
Publication date: 24 November 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
(n)-dimensional polytopes (52B11) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs ⋮ A construction for non-rank facets of stable set polytopes of webs ⋮ On claw-free \(t\)-perfect graphs ⋮ Clique family inequalities for the stable set polytope of quasi-line graphs. ⋮ A friction factor bound for transitional pipe flow ⋮ On non-rank facets of stable set polytopes of webs with clique number four ⋮ Unnamed Item ⋮ Strength of facets for the set covering and set packing polyhedra on circulant matrices ⋮ A new lifting theorem for vertex packing ⋮ The 2-hop spanning tree problem ⋮ Almost all webs are not rank-perfect
This page was built for publication: Stable Set Polytopes for a Class of Circulant Graphs
