License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SOCG.2015.141
URN: urn:nbn:de:0030-drops-51323
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5132/
Go to the corresponding LIPIcs Volume Portal


Biedl, Therese ; Derka, Martin

1-String B_2-VPG Representation of Planar Graphs

pdf-format:
49.pdf (0.7 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{biedl_et_al:LIPIcs:2015:5132,
  author =	{Therese Biedl and Martin Derka},
  title =	{{1-String B_2-VPG Representation of Planar Graphs}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{141--155},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Lars Arge and J{\'a}nos Pach},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5132},
  URN =		{urn:nbn:de:0030-drops-51323},
  doi =		{10.4230/LIPIcs.SOCG.2015.141},
  annote =	{Keywords: Graph drawing, string graphs, VPG graphs, planar graphs}
}

Keywords: Graph drawing, string graphs, VPG graphs, planar graphs
Seminar: 31st International Symposium on Computational Geometry (SoCG 2015)
Issue Date: 2015
Date of publication: 11.06.2015


DROPS-Home | Fulltext Search | Imprint Published by LZI