@misc{gdea_3702,
          editor = {Patrick Healy and Nikola S. Nikolov},
           title = {Crossing number of toroidal graphs},
          author = {J\'anos Pach and G\'eza T\'oth},
       publisher = {Springer},
            year = {2006},
           pages = {334--342},
             url = {http://gdea.informatik.uni-koeln.de/702/},
        abstract = {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.
    }
}