Intersection number and stability of some inscribable graphs
From MaRDI portal
Publication:2520774
DOI10.1007/s10711-016-0170-4zbMath1359.52006arXiv1412.5670OpenAlexW2964140927MaRDI QIDQ2520774
Publication date: 16 December 2016
Published in: Geometriae Dedicata (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5670
Hyperbolic and elliptic geometries (general) and generalizations (51M10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Geometric constructions in real or complex geometry (51M15) Graph theory (05C99) Convex sets in (3) dimensions (including convex surfaces) (52A15) Circle packings and discrete conformal geometry (52C26)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to cage an egg
- The convergence of circle packings to the Riemann mapping
- Existence and uniqueness of packings with specified combinatorics
- Graph-theoretical conditions for inscribability and Delaunay realizability
- A characterization of ideal polyhedra in hyperbolic 3-space
- Polyhedra inscribed in a quadric
- Andreev's theorem on hyperbolic polyhedra
- On the Teichmüller theory of circle patterns
- A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
- Differential Topology
- Lectures on Polytopes
- Hyperideal polyhedra in hyperbolic 3-space
- Variational principles for circle patterns and Koebe’s theorem
- ON CONVEX POLYHEDRA OF FINITE VOLUME IN LOBAČEVSKIĬ SPACE
- How many cages midscribe an egg
This page was built for publication: Intersection number and stability of some inscribable graphs