A linear upper bound on the rectilinear crossing number
From MaRDI portal
Publication:6476458
arXivmath/0512392MaRDI QIDQ6476458FDOQ6476458
Publication date: 16 December 2005
Abstract: 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.
This page was built for publication: A linear upper bound on the rectilinear crossing number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6476458)
