Abstract
We introduce a variation of unit-distance graphs which we call emph clear unit-distance graphs. They require the pairwise distances of the representing points to be either exactly 1 or not close to 1. We discuss properties and applications of clear unit-distance graphs.
| Original language | English |
|---|---|
| Title of host publication | EuroCG 2013 |
| Subtitle of host publication | The 29th European Workshop on Computational Geometry: March 17-20, 2013, Braunschweig, Germany |
| Pages | 213-216 |
| Number of pages | 4 |
| Publication status | Published - 2013 |
Keywords
- CG, GRAPH, GD