477 search results - page 1 / 96 » Removing even crossings |
GD
2009
Springer
13 years 9 months ago
2009
Springer
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
ENDM
2007
13 years 4 months ago
2007
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
JCT
2007
13 years 4 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...
VISSYM
2004
13 years 5 months ago
2004
Experimental evidence has shown that water diffusion is anisotropic in organized tissues such as white matter or muscles. Diffusion Tensor Imaging (DTI) is a non invasive MR techn...
DMTCS
2010
13 years 1 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...