Homothetic triangle representations of planar graphs
From MaRDI portal
Publication:5240366
DOI10.7155/JGAA.00509zbMATH Open1425.05034arXiv1908.11749OpenAlexW2977763040MaRDI QIDQ5240366FDOQ5240366
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)
Abstract: We prove that every planar graph is the intersection graph of homothetic triangles in the plane.
Full work available at URL: https://arxiv.org/abs/1908.11749
Cites Work
- Planar graphs and poset dimension
- A variational principle for circle packings.
- Square tilings with prescribed combinatorics
- Title not available (Why is that?)
- Rectangle and Square Representations of Planar Graphs
- Optimal polygonal representation of planar graphs
- On Touching Triangle Graphs
- Max-tolerance graphs as intersection graphs
- On Triangle Contact Graphs
- Contact representations of planar graphs with cubes
- Computing cartograms with optimal complexity
- Triangle Contact Representations and Duality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge-weighted contact representations of planar graphs
- Integer Representations of Convex Polygon Intersection Graphs
- Homothetic triangle contact representations
- Dushnik-Miller dimension of TD-Delaunay complexes
- Proportional Contact Representations of Planar Graphs
- Pentagon contact representations
Cited In (5)
This page was built for publication: Homothetic triangle representations of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5240366)
