| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 414627 | Computational Geometry | 2015 | 8 Pages |
Abstract
It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmović, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Noga Alon, Ohad N. Feldheim,