Coin graphs, polyhedra, and conformal mapping
From MaRDI portal
Publication:1339871
DOI10.1016/0012-365X(93)E0068-FzbMath0808.05043WikidataQ29399829 ScholiaQ29399829MaRDI QIDQ1339871
Publication date: 5 March 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Apollonian ball packings and stacked polytopes, Unit disk graph recognition is NP-hard, Oded Schramm: from circle packing to SLE, Three techniques for obtaining algebraic circle packings, Variational principles for circle patterns and Koebe’s theorem, The Colin de Verdière number and sphere representations of a graph, On-line coloring of geometric intersection graphs, The edge-transitive polytopes that are not vertex-transitive
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The convergence of circle packings to the Riemann mapping
- Schwarz's lemma for circle packings
- A variational principle for circle packings.
- The Schwarz-Pick lemma for circle packings
- Existence and uniqueness of packings with specified combinatorics
- Some problems on polyhedra
- Fixed points, Koebe uniformization and circle packings
- Colorings of Circles
- A Note on Planar Graphs and Circle Orders
- An Inverse Problem for Circle Packing and Conformal Mapping
- Empilements de cercles: Convergence d’une méthode de point fixe
- ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES
- ON CONVEX POLYHEDRA OF FINITE VOLUME IN LOBAČEVSKIĬ SPACE