On the edge-length ratio of outerplanar graphs

DOI10.1016/j.tcs.2018.10.002zbMath1426.68221arXiv1709.00043OpenAlexW2963536983WikidataQ62042361 ScholiaQ62042361MaRDI QIDQ1740698

William J. Lenhart, Giuseppe Liotta, Sylvain Lazard

Publication date: 2 May 2019

Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

outerplanar graphsgraph drawingedge-length ratio

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (5)

On Edge-Length Ratios of Partial 2-Trees ⋮ Splitting plane graphs to outerplanarity ⋮ Untangling circular drawings: algorithms and complexity ⋮ On the edge-length ratio of planar graphs ⋮ On the Edge-Length Ratio of 2-Trees

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of minimizing wire lengths in VLSI layouts
• Finding the intersection of two convex polyhedra
• Fixed edge-length graph drawing is NP-hard
• Angles of Planar Triangular Graphs
• CCured
• Planar Embeddings of Graphs with Specified Edge Lengths
• Graph Drawing

This page was built for publication: On the edge-length ratio of outerplanar graphs