Toward a Unit Distance Embedding for the Heawood graph

Abstract

The unit distance embeddability of a graph, like planarity, involves a mix of constraints that are combinatorial and geometric. We construct a unit distance embedding for $H-e$ in the hope that it will lead to an embedding for $H$. We then investigate analytical methods for a general decision procedure for testing unit distance embeddability.

7 pages, 4 figures

References in corpus (1)

• Minimal Polynomials for the Coordinates of the Harborth Graph