Some criteria for circle packing types and combinatorial Gauss-Bonnet Theorem
From MaRDI portal
Publication:5023566
DOI10.1090/tran/8503zbMath1481.52008arXiv2003.07059OpenAlexW3011177023WikidataQ114093763 ScholiaQ114093763MaRDI QIDQ5023566
Publication date: 24 January 2022
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.07059
Planar graphs; geometric and topological aspects of graph theory (05C10) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)
Related Items (1)
Uses Software
Cites Work
- Strong isoperimetric inequalities and combinatorial curvatures on multiply connected planar graphs
- Curvature, geometry and spectral properties of planar graphs
- Unimodular hyperbolic triangulations: circle packing and random walk
- Duality properties of strong isoperimetric inequalities on a planar graph and combinatorial curvatures
- The convergence of circle packings to the Riemann mapping
- Circle packings in different geometries
- Gauss-Bonnet formula, finiteness condition, and characterizations of graphs embedded in surfaces
- Combinatorial modulus and type of graphs
- The extremal length of a network
- A combinatorial analogue of a theorem of Myers
- Square tilings with prescribed combinatorics
- Potential theory on infinite networks
- The combinatorial Riemann mapping theorem
- On the norms of the random walks on planar graphs
- Negatively curved graph and planar metrics with applications to type
- Curvature and geometry of tessellating plane graphs
- The set of vertices with positive curvature in a planar graph with nonnegative curvature
- A simple criterion for transience of a reversible Markov chain
- Hyperbolic and parabolic packings
- Geometric analysis aspects of infinite semiplanar graphs with nonnegative curvature
- Hyperbolic and parabolic unimodular random maps
- Fixed points, Koebe uniformization and circle packings
- Layered circle packings
- On the number of vertices of positively curved planar graphs
- Probability on Trees and Networks
- An analogue of the Descartes-Euler formula for infinite graphs and Higuchi’s conjecture
- The Gauss-Bonnet formula of polytopal manifolds and the characterization of embedded graphs with nonnegative curvature
- Layered circlepackings and the type problem
- A recurrence/transience result for circle packings
- A note on tilings and strong isoperimetric inequality
- Combinatorial curvature for planar graphs
- Planar Maps, Random Walks and Circle Packing
- Conformal and cp types of surfaces of class $\mathcal {S}$
- Geodesics in non-positively curved plane tessellations
- A maximum principle for graphs
- Bounded valence excess and the parabolicity of tilings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some criteria for circle packing types and combinatorial Gauss-Bonnet Theorem