Now showing items 1-1 of 1
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 ...