## Odd Crossing Number Is Not Crossing Number
Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel
(2006)
Full text not available from this repository. ## AbstractThe crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the number of pairs of edges that intersect an odd number of times, we obtain the {em odd crossing number}. We show that there is a graph for which these two concepts differ, answering a well-known open question on crossing numbers. To derive the result we study drawings of maps (graphs with rotation systems).
Repository Staff Only: item control page References |