JCT
2007
13 years 11 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
COMBINATORICS
2006
13 years 11 months ago
2006
We give a simpler proof of the result of Boros and F
GD
2007
Springer
14 years 5 months ago
2007
Springer
We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, tha...