EPG-representations with small grid-size

Therese Biedl, Martin Derka, Vida Dujmovic +1

In an EPG-representation of a graph $G$ each vertex is represented by a path in the rectangular grid, and $(v,w)$ is an edge in $G$ if and only if the paths representing $v$ an $w$…