Drawing outerplanar graphs using thirteen edge lengths

Ziv Bakhajian, Ohad Noy Feldheim*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We show that every outerplanar graph 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.

Original languageAmerican English
Article number101964
Pages (from-to)1-16
Number of pages16
JournalComputational Geometry: Theory and Applications
Volume110
DOIs
StatePublished - Mar 2023

Bibliographical note

Funding Information:
We would like to thank an anonymous referee for useful remarks which significantly improved the presentation of our results and their context.

Publisher Copyright:
© 2022 Elsevier B.V.

Keywords

  • Distance number of a graph
  • Drawing of a graph
  • Outerplanar graphs
  • Planar graphs

Fingerprint

Dive into the research topics of 'Drawing outerplanar graphs using thirteen edge lengths'. Together they form a unique fingerprint.

Cite this