2019/07/28 by Ziv Bakhajian, Bakhajian, Ziv, Ohad N. Feldheim +1
Computer Science · Engineering · #05C10 #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #G.2.2 #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1907.13104
openalex publication_date 2019/07/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that every outerplanar graph G can be linearly embedded in the plane such that the number of distinct distances between pairs of adjacent vertices is at most thirteen and there is no intersection between the image of a vertex and that of an edge not containing it. This extends the work of Alon and the second author, where only overlap between vertices was disallowed, thus settling a problem posed by Carmi, Dujmović, Morin and Wood.