Pages that link to "Item:Q1092413"
From MaRDI portal
The following pages link to Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs) (Q1092413):
Displaying 6 items.
- A universality theorem for projectively unique polytopes and a conjecture of Shephard (Q273091) (← links)
- Einfache, konvexe Polytope und ihre Graphen (Q1058730) (← links)
- Puzzles and polytope isomorphisms (Q1096888) (← links)
- A simple way to tell a simple polytope from its graph (Q1120602) (← links)
- Identifying a polytope by its fibre polytopes (Q2022358) (← links)
- Around A. D. Alexandrov’s uniqueness theorem for convex polytopes (Q4910047) (← links)