Now showing items 1-2 of 2
On 2-crossing-critical graphs with a V8-minor
(University of Waterloo, 2014-05-22)
The crossing number of a graph is the minimum number of pairwise edge crossings in a drawing of a graph. A graph $G$ is $k$-crossing-critical if it has crossing number at least $k$, and any subgraph of $G$ has crossing ...
On Geometric Drawings of Graphs
(University of Waterloo, 2018-04-18)
This thesis is about geometric drawings of graphs and their topological generalizations. First, we study pseudolinear drawings of graphs in the plane. A pseudolinear drawing is one in which every edge can be extended ...