Toward a Unit Distance Embedding for the Heawood graph

MaRDI QIDQ6207426zbMATH OpenFDO

Authors Mitchell Alan Harris

Publication date 7 November 2007

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

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.

This page was built for publication: Toward a Unit Distance Embedding for the Heawood graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6207426)