Drawing outerplanar graphs using three edge lengths

DOI10.1016/j.comgeo.2014.10.006zbMath1305.05156arXiv1208.0744OpenAlexW3101983524MaRDI QIDQ482350

Noga Alon, Ohad Noy Feldheim

Publication date: 23 December 2014

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

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

zbMATH Keywords

outerplanar graphsdegenerate drawing of a graphdistance number 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)

Related Items (4)

Planar straight-line realizations of 2-trees with prescribed edge lengths ⋮ Drawing outerplanar graphs using thirteen edge lengths ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Degenerate drawing of outerplanar graphs with two edge lengths

Cites Work

• Distinct distances in graph drawings
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• On Sets of Distances of n Points
• Unnamed Item
• Unnamed Item
• Unnamed Item

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