Crossing number of toroidal graphs

Pach, János and Tóth, Géza (2006) Crossing number of toroidal graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 334-342 (Official URL:

Full text not available from this repository.


It is shown that if a graph of n vertices can be drawn on the torus without edge crossings and the maximum degree of its vertices is at most d, then its planar crossing number cannot exceed c_dn, where c_d is a constant depending only on d. This bound, conjectured by Brass, cannot be improved, apart from the value of the constant. We strengthen and generalize this result to the case when the graph has a crossing-free drawing on an orientable surface of higher genus and there is no restriction on the degrees of the vertices.

Item Type:Conference Paper
Additional Information:10.1007/11618058_30
Classifications:G Algorithms and Complexity > G.420 Crossings
Z Theory > Z.001 General
ID Code:702

Repository Staff Only: item control page


G. Cairns and Y. Nikolayevsky.: Bounds for generalized thrackles, Discrete Comput. Geom., 23 (2000), 191--206.

B. Mohar and C. Thomassen.: Graphs on surfaces, Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD, 2001.

G. Salazar and E. Ugalde: An improved bound for the crossing number of C\sb m\times C\sb n: a self-contained proof using mostly combinatorial arguments, Graphs Combin., 20 (2004), 247--253.