Sciweavers

JCT
2007
111views more  JCT 2007»
13 years 11 months ago
Removing even crossings
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...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
DCG
2008
93views more  DCG 2008»
13 years 11 months ago
Odd Crossing Number and Crossing Number Are Not the Same
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...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
GD
2005
Springer
14 years 5 months ago
Odd Crossing Number Is Not Crossing Number
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...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
GD
2007
Springer
14 years 5 months ago
Crossing Numbers and Parameterized Complexity
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...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...