Toward a Unit Distance Embedding for the Heawood graph
msra(2007)
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.
MoreTranslated text
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined