{"entities":{"Q6827682":{"pageid":15106045,"ns":120,"title":"Item:Q6827682","lastrevid":56002804,"modified":"2026-02-24T12:27:50Z","type":"item","id":"Q6827682","labels":{"en":{"language":"en","value":"On the edge-length ratio of outerplanar graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7050149"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6827682$80716144-D0A9-48E1-B48B-9343948C8614","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1ffd45a56e6d622196527404cca5ae5320255386","datavalue":{"value":{"text":"On the edge-length ratio of outerplanar graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6827682$2B546A67-3E85-4E65-AD48-21AC0B72A3A1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"432fe227c50d4bd0b8a13adeb42ea556fb2540df","datavalue":{"value":"1426.68221","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6827682$A2566753-AF20-4F83-B0DC-454651B22633","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"eea4599b28bc5f9b3732e5a43b3ebf8e3ad186aa","datavalue":{"value":"10.1016/J.TCS.2018.10.002","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6827682$AC4F1601-7286-4794-A79C-6E4815ABBE9F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5d7f0719d87deaf30347811b63abf9ff6502426f","datavalue":{"value":{"entity-type":"item","numeric-id":325149,"id":"Q325149"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6827682$D2761E6D-580C-46EE-B02D-7FA50754A879","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"70470388811b430ae63918166a25d5e4f1096bd1","datavalue":{"value":{"entity-type":"item","numeric-id":501675,"id":"Q501675"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6827682$548A4987-61A7-4EEA-AC3E-708F843694B5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b3b91e1ff54b2c86f8b88e26224138bb2ec8f237","datavalue":{"value":{"entity-type":"item","numeric-id":235642,"id":"Q235642"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6827682$36C7A954-C605-4BF6-A5B7-12C4967CE946","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f3c424cd94a60f9664f9fb69cc6027e75cc7ff3f","datavalue":{"value":{"entity-type":"item","numeric-id":123643,"id":"Q123643"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6827682$B3E0ECAC-2AF2-436A-BFA2-7884EEDD467F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fe967a6646fb6ad4126028ed66c1cfc1a0b6f1a6","datavalue":{"value":{"time":"+2019-05-02T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6827682$01A67467-A32D-4695-ABA5-6F04FE5F3198","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"3dd4e9bcdb35cd651a7121cee3be805b6804d4f7","datavalue":{"value":"The paper approaches the problem of computing a planar straight-line drawing of a planar graph with prescribed edge lengths constraints. Depending on the planar graph class and the specific edge constraints, multiple NP-hardness results are known: 3-connected planar graphs with prescribed edge lengths, 2-connected planar graphs with uniform lengths, degree-4 trees with vertices at integer points and edges of equal length etc.\\N\\NThe authors hence focus on the natural variant of the problem asking to compute planar straight-line drawings where the variance of the lengths of the edges is minimized. Let us define the planar edge-length ratio of a planar graph \\(G\\) as the smallest ratio between the longest and the shortest edge lengths over all planar straight-line drawings of \\(G\\). The principal result of the paper is the proof that that 2 is a tight bound for the planar edge-length ratio of outerplanar graphs. The authors show that any outerplanar graph admits a planar straight-line drawing such that the length ratio of the longest to the shortest edges is strictly less than 2 and that this result is tight in the sense that for any \\(\\varepsilon > 0\\) there are outerplanar graphs that cannot be drawn with an edge-length ratio smaller than \\(2-\\varepsilon\\). Finally they also prove that this ratio cannot be bounded if the topological embeddings of the outerplanar graphs are given.","type":"string"},"datatype":"string"},"type":"statement","id":"Q6827682$CA29A54C-0C67-4395-9798-6C48B127E9C7","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"d7f1127c63fcb04479eae252afd6f073fe30fe10","datavalue":{"value":{"entity-type":"item","numeric-id":187117,"id":"Q187117"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6827682$6B4F15A6-DC9B-4323-B475-A02F7A055D90","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6827682$C5D33C53-9BFB-4B63-9773-295C41E44657","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"357c7c34a1a90d83243f17011b7aa90788d1792d","datavalue":{"value":"05C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6827682$5F326BE0-C7AD-4157-873C-EF23045238F1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"022f028036f3dd930716ab6650f291ec9f66b3c6","datavalue":{"value":"7050149","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6827682$4211156E-256B-4C76-B457-4D5B79EBEEB6","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3e257e9a17bc983a6f139f0c77c64fcf0b8963f7","datavalue":{"value":"graph drawing","type":"string"},"datatype":"string"},"type":"statement","id":"Q6827682$6B736589-080A-4FB3-9CA6-B342CEEEF64A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b3fe4fabbe15c374b3531ed45dc9baf54b0bb77c","datavalue":{"value":"outerplanar graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6827682$528675A8-D350-48D2-8539-EF4008E278E5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0b9bb0a747f0584bdedf7aefd7fca755de76d174","datavalue":{"value":"edge-length ratio","type":"string"},"datatype":"string"},"type":"statement","id":"Q6827682$3EB3A6F9-059D-48D9-BC82-39C756448EED","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6827682$F1856D45-4C21-47D6-A8C3-F65885A07D2D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the edge-length ratio of outerplanar graphs (scientific article; zbMATH DE number 7050149)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_edge-length_ratio_of_outerplanar_graphs_(scientific_article;_zbMATH_DE_number_7050149)"}}}}}