Given a straight-line drawing of a graph, a segment is a maximal set of
...
In a graph story the vertices enter a graph one at a time and each verte...
A drawing of a graph is greedy if for each ordered pair of vertices u an...
We introduce the family of k-gap-planar graphs for k ≥ 0, i.e., graphs
t...
share