Toward a Unit Distance Embedding for the Heawood graph

Autor:	Harris, Mitchell A.
Rok vydání:	2007
Předmět:	Mathematics - Combinatorics 05C10
Druh dokumentu:	Working Paper
Popis:	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. Comment: 7 pages, 4 figures
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/0711.1157 Zobrazit plný text záznamu View this record from Arxiv