Outerplanar Graphs and Delaunay Triangulations
This document has been relocated to https://scholarworks.smith.edu/csc_facpubs/311/
Abstract
Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs. © 2012 Springer-Verlag.
This paper has been withdrawn.