On the Edge-length Ratio of Outerplanar Graphs


We show that any outerplanar graph admits a planar straightline drawing such that the length ratio of the longest to the shortest edges is strictly less than 2. This result is tight in the sense that for any > 0 there are outerplanar graphs that cannot be drawn with an edge-length ratio smaller than 2 − . We also show that every bipartite outerplanar graph… (More)


2 Figures and Tables

Cite this paper

@article{Lazard2017OnTE, title={On the Edge-length Ratio of Outerplanar Graphs}, author={Sylvain Lazard and William J. Lenhart and Giuseppe Liotta}, journal={CoRR}, year={2017}, volume={abs/1709.00043} }