Do we really understand the crossing numbers?

Authors:
Bojan Mohar
Affiliations:
Department of Mathematics, Simon Fraser University, Burnaby, BC
Venue:
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Year:
2010

Citing 8
Cited 0

Bounds for rectilinear crossing numbers

Journal of Graph Theory
Computing crossing numbers in quadratic time

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The Minor Crossing Number

SIAM Journal on Discrete Mathematics
Computing crossing number in linear time

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Crossing and Weighted Crossing Number of Near-Planar Graphs

Graph Drawing
On the crossing number of almost planar graphs

GD'06 Proceedings of the 14th international conference on Graph drawing
Adding one edge to planar graphs makes crossing number hard

Proceedings of the twenty-sixth annual symposium on Computational geometry
Odd crossing number is not crossing number

GD'05 Proceedings of the 13th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The crossing number of a graph is the minimum number of crossings that occur in a drawing of the graph in the plane. This notion is natural and easy to understand, yet we do not know much about it apart from some basic properties. History, successes and pitfalls, some recent developments, and future directions will be presented.