A linear upper bound on the rectilinear crossing number

Simple item page
dc.creatorWood, David R.
dc.date2005-12-16
dc.date2006-06-19
dc.date.accessioned2026-07-07T06:55:25Z
dc.date.available2026-07-07T06:55:25Z
dc.descriptionIt 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.
dc.descriptionThis 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
dc.identifierhttps://arxiv.org/abs/math/0512392
dc.identifierhttp://arxiv.org/abs/math/0512392
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106270
dc.subjectCombinatorics
dc.subject05C10
dc.titleA linear upper bound on the rectilinear crossing number
dc.typetext

Files

Collections

arXiv