gdea_3Crossing number of toroidal graphsJánosPachauthorGézaTóthauthorIt 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. G.420 CrossingsZ.001 General2006SpringerConference Paper

For work being deposited by its own author: In self-archiving this collection of files and associated bibliographic metadata, I grant gdea the right to store them and to make them permanently available publicly for free on-line. I declare that this material is my own intellectual property and I understand that gdea does not assume any responsibility if there is any breach of copyright in distributing these files or metadata. (All authors are urged to prominently assert their copyright on the title page of their work.)

For work being deposited by someone other than its author: I hereby declare that the collection of files and associated bibliographic metadata that I am archiving at gdea) is in the public domain. If this is not the case, I accept full responsibility for any breach of copyright that distributing these files or metadata may entail.

Clicking on the deposit button indicates your agreement to these terms.