A quantitative Steinitz' theorem
From MaRDI portal
Recommendations
- An analogue of a theorem of Steinitz for ball polyhedra in \(\mathbb{R}^3\)
- Skyscraper polytopes and realizations of plane triangulations
- A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates
- Realizing planar graphs as convex polytopes
Cited in
(17)- An analogue of a theorem of Steinitz for ball polyhedra in \(\mathbb{R}^3\)
- scientific article; zbMATH DE number 2208512 (Why is no real title available?)
- Nonrational configurations, polytopes, and surfaces
- Noch ein Erdbeben in der vierten Dimension
- Realizing planar graphs as convex polytopes
- Advances in the theory and practice of graph drawing
- Quantitative Steinitz theorem: A polynomial bound
- Small grid embeddings of 3-polytopes
- The convex dimension of a graph
- Skyscraper polytopes and realizations of plane triangulations
- A Short Proof of Stein’s Universal Multiplier Theorem
- Polyhedral tori with minimal coordinates
- scientific article; zbMATH DE number 5548551 (Why is no real title available?)
- scientific article; zbMATH DE number 896410 (Why is no real title available?)
- Separable partitions
- The Stein-Tomas inequality in trace ideals
- A duality transform for constructing small grid embeddings of 3d polytopes
This page was built for publication: A quantitative Steinitz' theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339977)
