2026-07-23T20:16:38Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5132 2024-03-06T10:35:51Z ddc:004 open_access

1-String B_2-VPG Representation of Planar Graphs Biedl, Therese Derka, Martin Graph drawing string graphs VPG graphs planar graphs In this paper, we prove that every planar graph has a 1-string B_2-VPG representation - a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices u, v intersect precisely once whenever there is an edge between u and v. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Therese Biedl and Martin Derka 2015 Is Part Of LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SOCG.2015.141 urn:nbn:de:0030-drops-51323 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.141 eng https://creativecommons.org/licenses/by/3.0/legalcode