Antiwebs are rank-perfect
From MaRDI portal
Publication:1885339
DOI10.1007/s10288-003-0032-4zbMath1112.05082OpenAlexW2036645770MaRDI QIDQ1885339
Publication date: 28 October 2004
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-003-0032-4
Programming involving graphs or networks (90C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On the Chvátal-rank of Antiwebs ⋮ Comparing Imperfection Ratio and Imperfection Index for Graph Classes ⋮ 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 ⋮ $t$-Perfection in $P_5$-Free Graphs ⋮ Characterizing N+-perfect line graphs ⋮ Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs ⋮ 2-clique-bond of stable set polyhedra ⋮ Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope ⋮ On circular-perfect graphs: a survey ⋮ On the Chvátal rank of linear relaxations of the stable set polytope ⋮ Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope ⋮ On classes of minimal circular-imperfect graphs ⋮ Unnamed Item ⋮ The nonidealness index of rank-ideal matrices ⋮ On packing and covering polyhedra of consecutive ones circulant clutters ⋮ Computing the clique number of \(a\)-perfect graphs in polynomial time ⋮ On the set covering polyhedron of circulant matrices ⋮ Characterizing and bounding the imperfection ratio for some classes of graphs ⋮ Triangle-free strongly circular-perfect graphs ⋮ On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets ⋮ Lovász-Schrijver PSD-Operator on Claw-Free Graphs ⋮ A lower bound on the Chvátal-rank of Antiwebs ⋮ Almost all webs are not rank-perfect
This page was built for publication: Antiwebs are rank-perfect
