On non-rank facets of stable set polytopes of webs with clique number four
From MaRDI portal
(Redirected from Publication:2492218)
Recommendations
Cites work
- A class of facet producing graphs for vertex packing polyhedra
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3496213 (Why is no real title available?)
- Mobility models for cellular mobile radiotelephone networks: Product forms and blocking
- Near-perfect matrices
- On certain polytopes associated with graphs
- On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
- On stable set polyhedra for K//(1,3)free graphs
- On the strong perfect graph conjecture
- Perfect zero–one matrices
- Rank-perfect and weakly rank-perfect graphs
- Stable Set Polytopes for a Class of Circulant Graphs
- The rank facets of the stable set polytope for claw-free graphs
Cited in
(3)
This page was built for publication: On non-rank facets of stable set polytopes of webs with clique number four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492218)