Fary [3] proved that all planar graphs can be drawn in the plane using only straight line segments. Harborth et al. [7] ask whether or not there exists such a drawing where all edges have integer lengths, and Geelen et al. [4] proved that cubic planar graphs satised this conjecture. We re-prove their result using rigidity theory, exhibit other natural families of planar graphs that satisfy this conjecture as immediate corollaries, and also prove a weaker result for all planar graphs in R 3 .
['Timothy Sun']
Rigidity-Theoretic Constructions of Integral Fary Embeddings