The following pages link to Some problems on polyhedra (Q1822357):
Displaying 12 items.
- Toughness and Delaunay triangulations (Q803161) (← links)
- How to cage an egg (Q803943) (← links)
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs (Q805630) (← links)
- Realizability of Delaunay triangulations (Q911323) (← links)
- Note on inscribability of quadrangular polyhedra with restricted number of edge-types (Q1180135) (← links)
- Coin graphs, polyhedra, and conformal mapping (Q1339871) (← links)
- Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410) (← links)
- A unique representation of polyhedral types. Centering via Möbius transformations (Q1771986) (← links)
- Scribability problems for polytopes (Q2359975) (← links)
- (Q4701023) (← links)
- Weakly inscribed polyhedra (Q5864304) (← links)
- COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES (Q6134981) (← links)
