Toward a Unit Distance Embedding for the Heawood graph

Mitchell A. Harris

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…