Not all simplicial polytopes are weakly vertex-decomposable
From MaRDI portal
Publication:6231483
DOI10.1287/moor.1120.0554zbMath1297.52002arXiv1203.1676MaRDI QIDQ6231483
Jesús A. De Loera, Steven Klee
Publication date: 7 March 2012
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55) Linear programming (90C05) Combinatorial aspects of simplicial complexes (05E45) Combinatorial complexity of geometric structures (52C45)
This page was built for publication: Not all simplicial polytopes are weakly vertex-decomposable