A linear upper bound on the rectilinear crossing number
组合数学
2007-05-23 v2
摘要
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.
引用
@article{arxiv.math/0512392,
title = {A linear upper bound on the rectilinear crossing number},
author = {David R. Wood},
journal= {arXiv preprint arXiv:math/0512392},
year = {2007}
}
备注
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