On Edge-Length Ratios of Partial 2-Trees

DOI10.1142/S0218195921500072zbMath1487.68174OpenAlexW4210253419MaRDI QIDQ5072225

Giuseppe Liotta, Jiří Fiala, Václav Blažj

Publication date: 26 April 2022

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195921500072

zbMATH Keywords

2-treeplanar straight-line drawingedge-length ratio

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the edge-length ratio of outerplanar graphs
• Fixed edge-length graph drawing is NP-hard
• Bemerkungen zum Vierfarbenproblem
• Graph Classes: A Survey
• On the Edge-Length Ratio of 2-Trees
• On the planar edge-length ratio of planar graphs
• Planar Embeddings of Graphs with Specified Edge Lengths
• Convex Maps

This page was built for publication: On Edge-Length Ratios of Partial 2-Trees