Drawing outerplanar graphs
Combinatorics
2016-08-10 v1
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, Dujmovic, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments.
Keywords
Cite
@article{arxiv.1208.0744,
title = {Drawing outerplanar graphs},
author = {Noga Alon and Ohad Noy Feldheim},
journal= {arXiv preprint arXiv:1208.0744},
year = {2016}
}
Comments
12 Pages, 5 Figures