Non-existence of annular separators in geometric graphs
DOI10.1007/s00454-023-00519-8arXiv2107.09790OpenAlexW3184366659MaRDI QIDQ6151030
Farzam Ebrahimnejad, James R. Lee
Publication date: 9 February 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.09790
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of tessellation and tiling problems (05B45) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- A mating-of-trees approach for graph distances in random planar maps
- Spectral partitioning works: planar graphs and finite element meshes
- Combinatorial aspects of geometric graphs
- Quasisymmetric parametrizations of two-dimensional metric spheres
- Growth and percolation on the uniform infinite planar triangulation
- Recurrence of distributional limits of finite planar graphs
- The fractal dimension of Liouville quantum gravity: universality, monotonicity, and bounds
- On planar graphs of uniform polynomial growth
- Growth and isoperimetric profile of planar graphs
- A Separator Theorem for Planar Graphs
- Separators for sphere-packings and nearest neighbor graphs
- Geometric Separators for Finite-Element Meshes
- Uniform Infinite Planar Triangulation and Related Time-Reversed Critical Branching Process
This page was built for publication: Non-existence of annular separators in geometric graphs
