文章基本信息

标题：1-String B_2-VPG Representation of Planar Graphs
本地全文：下载
作者：Therese Biedl ; Martin Derka
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2015
卷号：34
页码：141-155
DOI：10.4230/LIPIcs.SOCG.2015.141
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Graph drawing; string graphs; VPG graphs; planar graphs