Chiyoda-ku Tokyo 101-8430,

Abstract

The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph G that does not contain a fixed graph as a minor has crossing number O(∆n), where G has n vertices and maximum degree ∆. This dependence on n and ∆ is best possible. This result answers an open question of Wood and Telle [New York J. Mathematics, 2007], who proved the best previous bound of O(∆2n). In addition, we prove that every K5-minor-free graph G has crossing number at most 2 P v deg(v) 2, which again is the best possible dependence on the degrees of G. We also study the convex and rectilinear crossing numbers, and prove an O(∆n) bound for the convex crossing number of bounded pathwidth graphs, and a P v deg(v) 2 bound for the rectilin-ear crossing number of K3,3-minor-free graphs

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

http://www.fmf.uni-lj.si/%7Emo... (external link)

http://www.fmf.uni-lj.si/%7Emo... (external link)

http://citeseerx.ist.psu.edu/v... (external link)