Improved bounds for the crossing numbers on surfaces of genus g

DOI10.1007/3-540-57899-4_68zbMath1528.68323MaRDI QIDQ6184634

Farhad Shahrokhi, Imrich Vrt'o, László A. Székely, Ondrej Sýkora

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• On crossing numbers of hypercubes and cube connected cycles
• On \(k\)-planar crossing numbers
• Edge separators for graphs of bounded genus with applications
• A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
• An infinite family of octahedral crossing numbers
• The toroidal crossing number of the complete graph
• The toroidal crossing number of Km,n
• Crossing Number Problems

This page was built for publication: Improved bounds for the crossing numbers on surfaces of genus g