Pages that link to "Item:Q2583128"
From MaRDI portal
The following pages link to Almost all webs are not rank-perfect (Q2583128):
Displaying 14 items.
- Minor related row family inequalities for the set covering polyhedron of circulant matrices (Q324828) (← links)
- Facet-inducing web and antiweb inequalities for the graph coloring polytope (Q608302) (← links)
- On the facets of the stable set polytope of quasi-line graphs (Q635515) (← links)
- A construction for non-rank facets of stable set polytopes of webs (Q852709) (← links)
- On the set covering polyhedron of circulant matrices (Q1015320) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- An integer programming approach for solving a generalized version of the Grundy domination number (Q2032968) (← links)
- A new lifting theorem for vertex packing (Q2329651) (← links)
- On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
- On the facets of stable set polytopes of circular interval graphs (Q2673814) (← links)
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
- (Q2861547) (← links)
- A note on the Chvátal-rank of clique family inequalities (Q3004203) (← links)
