2-crossing critical graphs with a V8 minor
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 crossing number less than k. The set of 1-crossing critical graphs is is determ...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/6464 |