A simple way to tell a simple polytope from its graph
From MaRDI portal
Publication:1120602
DOI10.1016/0097-3165(88)90064-7zbMath0673.05087OpenAlexW2074536752WikidataQ60358418 ScholiaQ60358418MaRDI QIDQ1120602
Publication date: 1988
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(88)90064-7
Related Items
Combinatorial face enumeration in convex polytopes, The maximum number of faces of the Minkowski sum of two convex polytopes, Reconstructibility of Matroid Polytopes, Convex polytopes without triangular faces, On the Monotone Upper Bound Problem, Linear programming, the simplex algorithm and simple polytopes, Colorful polytopes and graphs, Self-dual binary codes from small covers and simple polytopes, Minkowski decomposition of associahedra and related combinatorics, Polytopality and Cartesian products of graphs, Polytopes close to being simple, The brick polytope of a sorting network, A note on shellability and acyclic orientations, Reconstructing simplicial polytopes from their graphs and affine 2-stresses, A FLAG VECTOR OF A 3‐SPHERE THAT IS NOT THE FLAG VECTOR OF A 4‐POLYTOPE, Hyperplane arrangements with a lattice of regions, The permuto-associahedron revisited, A non-geometric shelling of a 3-polytope, On the reconstruction of polytopes, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, Unique sink orientations of grids, Lattice congruences, fans and Hopf algebras., The graphicahedron, Cocircuit graphs and efficient orientation reconstruction in oriented matroids, Random edge can be exponential on abstract cubes, Graphs, skeleta and reconstruction of polytopes, The positive geometry for \(\varphi^p\) interactions, A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes, Reconstructing surface triangulations by their intersection matrices, Finding a simple polytope from its graph in polynomial time, Computing symmetry groups of polyhedra, A simple permutoassociahedron, On the number of faces of certain transportation polytopes, On a triangulation of the \(3\)-ball and the solid torus, On the \(k\)-systems of a simple polytope
Cites Work
