1-String B₂-VPG Representation of Planar Graphs
classification
💻 cs.CG
cs.DS
keywords
stringpathsplanarrepresentationbendscontainedgeevery
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.