396 search results - page 4 / 80 » Odd Crossing Number Is Not Crossing Number |
91
Voted
APVIS
2008
14 years 11 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
GD
2007
Springer
15 years 3 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...
71
Voted
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
JGT
2010
14 years 8 months ago
2010
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...