Now showing items 1-1 of 1
2-crossing critical graphs with a V8 minor
(University of Waterloo, 2012-01-17)
The crossing number of a graph is the minimum number of pairwise crossings of edges among all planar drawings of the graph. A graph G is k-crossing critical if it has crossing number k and any proper subgraph of G has a ...