Dushnik-Miller dimension of TD-Delaunay complexes
From MaRDI portal
Publication:2189828
DOI10.1016/j.ejc.2020.103110zbMath1442.05254arXiv1803.09576OpenAlexW3016991775MaRDI QIDQ2189828
Daniel Gonçalves, Lucas Isenmann
Publication date: 16 June 2020
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.09576
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of simplicial complexes (05E45)
Related Items (2)
Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes ⋮ Homothetic triangle representations of planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Delaunay graphs are almost as good as complete graphs
- Planar graphs and poset dimension
- The order dimension of the complete graph
- There are planar graphs almost as good as the complete graph
- The Stretch Factor of the Delaunay Triangulation Is Less than 1.998
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
- Degree Four Plane Spanners: Simpler and Better
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- The Order Dimension of Convex Polytopes
- Hamiltonicity and forbidden subgraphs in 4‐connected graphs
This page was built for publication: Dushnik-Miller dimension of TD-Delaunay complexes