Toward a Unit Distance Embedding for the Heawood graph

Details Toward a Unit Distance Embedding for the Heawood graph Toward a Unit Distance Embedding for the Heawood graph

2007-11-07

arxiv.org/abs/0711.1157v1

Mathematics

Combinatorics

7 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Toward a Unit Distance Embedding for the Heawood graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Toward a Unit Distance Embedding for the Heawood graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Toward a Unit Distance Embedding for the Heawood graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-377211