1-String B2-VPG Representation of Planar Graphs
Abstract
In this paper, we prove that every planar graph has a 1-string B2-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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.