Toward a Unit Distance Embedding for the Heawood graph

Simple item page
dc.creatorHarris, Mitchell A.
dc.date2007-11-07
dc.date.accessioned2026-07-07T08:41:25Z
dc.date.available2026-07-07T08:41:25Z
dc.descriptionThe 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.
dc.description7 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/0711.1157
dc.identifierhttp://arxiv.org/abs/0711.1157
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141666
dc.subjectCombinatorics
dc.subject05C10
dc.titleToward a Unit Distance Embedding for the Heawood graph
dc.typetext

Files

Collections

arXiv