Drawing outerplanar graphs using thirteen edge lengths

DOI10.1016/j.comgeo.2022.101964zbMath1506.05144arXiv1907.13104OpenAlexW3156272061MaRDI QIDQ2678265

Ziv Bakhajian, Ohad Noy Feldheim

Publication date: 9 January 2023

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.13104

zbMATH Keywords

planar graphsouterplanar graphsdistance number of a graphdrawing of a graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Drawing outerplanar graphs using three edge lengths
• On the Erdős distinct distances problem in the plane
• Distinct distances in graph drawings
• Degenerate drawing of outerplanar graphs with two edge lengths
• Graph Classes: A Survey
• On Sets of Distances of n Points

This page was built for publication: Drawing outerplanar graphs using thirteen edge lengths