Antiwebs are rank-perfect

DOI10.1007/S10288-003-0032-4MaRDI QIDQ1885339zbMATH OpenOpenAlexFDO

Authors Annegret K. Wagler

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

zbMATH Keywords

stable set polytoperank constraintsantiwebs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Almost all webs are not rank-perfect
• On the Chvàtal-rank of antiwebs
• On webs of maximum rank
• scientific article; zbMATH DE number 1735804
• Correction to: On webs of maximum rank
• scientific article; zbMATH DE number 279225
• Rank of ordinary webs in codimension one an effective method
• A lower bound on the Chvátal-rank of antiwebs
• Construction for antimagic generalized web graphs
• scientific article; zbMATH DE number 278934

Cited in

(26)

• Triangle-free strongly circular-perfect graphs
• Almost all webs are not rank-perfect
• On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
• Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
• A lower bound on the Chvátal-rank of antiwebs
• On the Chvàtal-rank of antiwebs
• Computing the clique number of \(a\)-perfect graphs in polynomial time
• Lovász-Schrijver PSD-operator on claw-free graphs
• The nonidealness index of rank-ideal matrices
• Characterizing and bounding the imperfection ratio for some classes of graphs
• Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope
• On the set covering polyhedron of circulant matrices
• Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs
• On classes of minimal circular-imperfect graphs
• On rank-perfect subclasses of near-bipartite graphs
• On the Chvàtal rank of linear relaxations of the stable set polytope
• Characterizing \(N_+\)-perfect line graphs
• On packing and covering polyhedra of consecutive ones circulant clutters
• A construction for non-rank facets of stable set polytopes of webs
• \(t\)-perfection in \(P_5\)-free graphs
• 2-clique-bond of stable set polyhedra
• On circular-perfect graphs: a survey
• On non-rank facets of stable set polytopes of webs with clique number four
• Comparing imperfection ratio and imperfection index for graph classes
• Computing the clique number of \(a\)-perfect graphs in polynomial time
• Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope

This page was built for publication: Antiwebs are rank-perfect

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885339)