David R. Wood
Published 2005-12-16, updated 2006-06-19Version 2
It is proved that the rectilinear crossing number of every graph with bounded tree-width and bounded degree is linear in the number of vertices. **** This paper has been withdrawn by the author. **** The results have been superseeded by the author's paper with Jan Arne Telle: "Planar decompositions and the crossing number of graphs with an excluded minor", http://arxiv.org/math/0604467.
Comments: This paper has been withdrawn by the author. The results have been superseeded by the author's paper with Jan Arne Telle: "Planar decompositions and the crossing number of graphs with an excluded minor", http://arxiv.org/math/0604467
On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs
An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers
New lower bounds for the number of $(\leq k)$-edges and the rectilinear crossing number of $K_n$
![QR code for arXiv:math/0512392 [math.CO]](http://oss.arxitics.com/images/favicon.svg)