Pages that link to "Item:Q1122592"
From MaRDI portal
The following pages link to An upper bound on the shortness exponent of inscribable polytopes (Q1122592):
Displayed 7 items.
- Toughness and Delaunay triangulations (Q803161) (← links)
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs (Q805630) (← links)
- Connectivity of plane triangulations (Q911313) (← links)
- Finding Hamiltonian cycles in certain planar graphs (Q916416) (← links)
- Coloring certain proximity graphs (Q917569) (← links)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249) (← links)
- On certain Hamiltonian inner triangulations (Q2367404) (← links)