Homothetic triangle representations of planar graphs
From MaRDI portal
Publication:5240366
DOI10.7155/jgaa.00509zbMath1425.05034arXiv1908.11749OpenAlexW2977763040MaRDI QIDQ5240366
Daniel Gonçalves, Alexandre Pinlou, Benjamin Lévêque
Publication date: 25 October 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.11749
Related Items (3)
Finding geometric representations of apex graphs is NP-hard ⋮ Finding geometric representations of apex graphs is \textsf{NP}-hard ⋮ Triangle contact representations and duality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar graphs and poset dimension
- A variational principle for circle packings.
- Square tilings with prescribed combinatorics
- Homothetic triangle contact representations
- Dushnik-Miller dimension of TD-Delaunay complexes
- Optimal polygonal representation of planar graphs
- Edge-weighted contact representations of planar graphs
- Rectangle and Square Representations of Planar Graphs
- On Touching Triangle Graphs
- Triangle Contact Representations and Duality
- Max-tolerance graphs as intersection graphs
- On Triangle Contact Graphs
- Integer Representations of Convex Polygon Intersection Graphs
- Contact representations of planar graphs with cubes
- Computing cartograms with optimal complexity
- Proportional Contact Representations of Planar Graphs
- Pentagon contact representations
This page was built for publication: Homothetic triangle representations of planar graphs