{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:47:50Z","timestamp":1770742070676,"version":"3.49.0"},"reference-count":14,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02n03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:p> The edge-length ratio of a planar straight-line drawing of a graph is the maximum ratio between the lengths of any two of its edges. When the edges to be considered in the ratio are required to be adjacent, the ratio is called local edge-length ratio. The (local) edge-length ratio of a graph [Formula: see text] is the infimum over all (local) edge-length ratios in the planar straight-line drawings of [Formula: see text]. We prove that the edge-length ratio of the [Formula: see text]-vertex 2-trees is [Formula: see text], which proves a conjecture by Lazard et al. [TCS 770, 2019, pp. 88\u201394] and complements an upper bound by Borrazzo and Frati [JoCG 11(1), 2020, pp. 137\u2013155]. <\/jats:p><jats:p> We also prove that every partial 2-tree admits a planar straight-line drawing whose local edge-length ratio is at most [Formula: see text] for any arbitrarily small [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0218195921500072","type":"journal-article","created":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T08:29:32Z","timestamp":1643358572000},"page":"141-162","source":"Crossref","is-referenced-by-count":2,"title":["On Edge-Length Ratios of Partial 2-Trees"],"prefix":"10.1142","volume":"31","author":[{"given":"V\u00e1clav","family":"Bla\u017ej","sequence":"first","affiliation":[{"name":"Faculty of Information Technology, Czech Technical University in Prague, Th\u00e1kurova 9, Prague 6, 160 00, Czech Republic"}]},{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Physics, Charles University, Ke Karlovu 3, Prague 2, 121 16, Czech Republic"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria, Universit\u00e0 degli Studi di Perugia, Edificio Presidenza, Perugia 06125, Italy"}]}],"member":"219","published-online":{"date-parts":[[2022,1,25]]},"reference":[{"key":"S0218195921500072BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-68766-3_7"},{"key":"S0218195921500072BIB002","first-page":"229","volume":"11","author":"F\u00e1ry I.","year":"1948","journal-title":"Acta Univ. Szeged. Sect. Sci. Math."},{"key":"S0218195921500072BIB003","volume-title":"Vorlesungen \u00fcber die Theorie der Polyeder unter Einschluss der Elemente der Topologie. Aus dem Nachlass hrsg. u. erg. v. Hans Rademacher","volume":"41","author":"Steinitz E.","year":"1934"},{"key":"S0218195921500072BIB004","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1951-0041425-5"},{"key":"S0218195921500072BIB005","first-page":"26","volume":"46","author":"Wagner K.","year":"1936","journal-title":"Jahresber. Dtsch. Math.-Ver."},{"key":"S0218195921500072BIB006","volume-title":"Graph Drawing Algorithms for the Visualization of Graphs","author":"Di Battista G.","year":"1999"},{"key":"S0218195921500072BIB007","first-page":"247","volume-title":"Handbook of Discrete and Computational Geometry","author":"Di Giacomo E.","year":"2017"},{"key":"S0218195921500072BIB008","doi-asserted-by":"publisher","DOI":"10.1142\/5648"},{"key":"S0218195921500072BIB009","doi-asserted-by":"publisher","DOI":"10.1201\/b15385"},{"key":"S0218195921500072BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90110-X"},{"key":"S0218195921500072BIB011","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00145"},{"key":"S0218195921500072BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.10.002"},{"key":"S0218195921500072BIB013","first-page":"137","volume":"11","author":"Borrazzo M.","year":"2020","journal-title":"J. Comput. Geom."},{"key":"S0218195921500072BIB014","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195921500072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T08:29:43Z","timestamp":1643358583000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195921500072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":14,"journal-issue":{"issue":"02n03","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["10.1142\/S0218195921500072"],"URL":"https:\/\/doi.org\/10.1142\/s0218195921500072","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}