On edge-length ratios of partial 2-trees
From MaRDI portal
Publication:5072225
DOI10.1142/S0218195921500072zbMATH Open1487.68174OpenAlexW4210253419MaRDI QIDQ5072225FDOQ5072225
Authors: Václav Blažj, Jiří Fiala, Giuseppe Liotta
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Planar Embeddings of Graphs with Specified Edge Lengths
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of graph drawing and visualization
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the planar edge-length ratio of planar graphs
- Bemerkungen zum Vierfarbenproblem
- Convex Maps
- Fixed edge-length graph drawing is NP-hard
- On the edge-length ratio of outerplanar graphs
- On the Edge-Length Ratio of 2-Trees
This page was built for publication: On edge-length ratios of partial 2-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5072225)