396 search results - page 1 / 80 » Odd Crossing Number Is Not Crossing Number |
GD
2007
Springer
13 years 11 months ago
2007
Springer
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...
DCG
2008
13 years 4 months ago
2008
The 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 nu...
GD
2005
Springer
13 years 10 months ago
2005
Springer
The 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 nu...
CCCG
2007
13 years 6 months ago
2007
ALGORITHMICA
2011
12 years 12 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...