Homothetic triangle representations of planar graphs
From MaRDI portal
(Redirected from Publication:5240366)
Abstract: We prove that every planar graph is the intersection graph of homothetic triangles in the plane.
Cites work
- scientific article; zbMATH DE number 3882450 (Why is no real title available?)
- scientific article; zbMATH DE number 6850320 (Why is no real title available?)
- scientific article; zbMATH DE number 3308932 (Why is no real title available?)
- A variational principle for circle packings.
- Computing cartograms with optimal complexity
- Contact representations of planar graphs with cubes
- Dushnik-Miller dimension of TD-Delaunay complexes
- Edge-weighted contact representations of planar graphs
- Homothetic triangle contact representations
- Integer representations of convex polygon intersection graphs
- Max-tolerance graphs as intersection graphs
- On Triangle Contact Graphs
- On touching triangle graphs
- Planar graphs and poset dimension
- Proportional Contact Representations of Planar Graphs
- Rectangle and Square Representations of Planar Graphs
- Square tilings with prescribed combinatorics
- Triangle Contact Representations and Duality
Cited in
(6)- Finding geometric representations of apex graphs is NP-hard
- Adjacency graphs of polyhedral surfaces
- Representation of Planar Hypergraphs by Contacts of Triangles
- Triangle contact representations and duality
- Finding geometric representations of apex graphs is \textsf{NP}-hard
- Adjacency graphs of polyhedral surfaces
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)
