396 search results - page 2 / 80 » Odd Crossing Number Is Not Crossing Number |
GD
2009
Springer
13 years 10 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 ...
ALGORITHMICA
2011
13 years 10 days ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
JCT
2007
13 years 5 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...
GD
2006
Springer
13 years 9 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...