Straight line embeddings of cubic planar graphs with integer edge lengths
From MaRDI portal
Recommendations
- Graph Drawing
- Planar Embeddings of Graphs with Specified Edge Lengths
- scientific article; zbMATH DE number 3968606
- On a straight-line embedding problem of graphs
- scientific article; zbMATH DE number 975332
- scientific article; zbMATH DE number 1138195
- On Polyhedral Embeddings of Cubic Graphs
- On simultaneous straight-line grid embedding of a planar graph and its dual
- scientific article; zbMATH DE number 3968607
- On embeddability of unit disk graphs onto straight lines
Cites work
Cited in
(12)- On the number of acute triangles in a straight-line embedding of a maximal planar graph
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Orthogonal cartograms with at most 12 corners per face
- On rational approximation of a geometric graph
- On some rational triangles
- Minimum Integral Drawings of the Platonic Graphs
- Plane integral drawings of the Platonic solid graphs with triangle faces
- Encounter at far point
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Integral and rational graphs in the plane
- Harborth's conjecture for 4-regular planar graphs
- Drawing trees and cacti with integer edge lengths on a polynomial-size grid (poster abstract)
This page was built for publication: Straight line embeddings of cubic planar graphs with integer edge lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522854)