$1$-String $B_2$-VPG Representation of Planar Graphs
Computational Geometry
2015-12-04 v2 Data Structures and Algorithms
Abstract
In this paper, we prove that every planar graph has a 1-string -VPG representation---a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices intersect precisely once whenever there is an edge between and .
Keywords
Cite
@article{arxiv.1411.7277,
title = {$1$-String $B_2$-VPG Representation of Planar Graphs},
author = {Therese Biedl and Martin Derka},
journal= {arXiv preprint arXiv:1411.7277},
year = {2015}
}
Comments
arXiv admin note: text overlap with arXiv:1409.5816