1-String B₂-VPG Representation of Planar Graphs
Biedl, Therese · Derka, Martin
Original · EN
In this paper, we prove that every planar graph has a 1-string B₂-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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.