The crossing number of K3,n in a surface
Journal of Graph Theory
An experimental study of the basis for graph drawing algorithms
Journal of Experimental Algorithmics (JEA)
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Which crossing number is it anyway?
Journal of Combinatorial Theory Series B
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Crossing-number critical graphs have bounded path-width
Journal of Combinatorial Theory Series B
Graph minors. XVI. excluding a non-planar graph
Journal of Combinatorial Theory Series B
Bounds on the max and min bisection of random cubic and random 4-regular graphs
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
On the Number of Incidences Between Points and Curves
Combinatorics, Probability and Computing
Crossing Numbers and Hard Erdös Problems in Discrete Geometry
Combinatorics, Probability and Computing
Arrangements, circular arrangements and the crossing number of C7× Cn
Journal of Combinatorial Theory Series B
European Journal of Combinatorics - Special issue: Topological graph theory
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SIAM Journal on Discrete Mathematics
Crossing number is hard for cubic graphs
Journal of Combinatorial Theory Series B
On the crossing numbers of Cartesian products with paths
Journal of Combinatorial Theory Series B
Some Recent Progress and Applications in Graph Minor Theory
Graphs and Combinatorics
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Crossing numbers of graph embedding pairs on closed surfaces
Journal of Graph Theory
The crossing number of Cm × Cn is as conjectured for n ≥ m(m + 1)
Journal of Graph Theory
Crossing number of graphs with rotation systems
GD'07 Proceedings of the 15th international conference on Graph drawing
Crossing number of toroidal graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Planar crossing numbers of genus g graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Approximating the crossing number of graphs embeddable in any orientable surface
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On crossing numbers of geometric proximity graphs
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
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∑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 ∑v deg(v)2 bound for the rectilinear crossing number of K3;3-minor-free graphs.