New bounds on crossing numbers
From MaRDI portal
Publication:1591053
DOI10.1007/S004540010011zbMath0963.05038OpenAlexW4249905773MaRDI QIDQ1591053
Géza Tóth, J. H. Spencer, János Pach
Publication date: 28 June 2001
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004540010011
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (15)
The crossing number of twisted graphs ⋮ There are no cubic graphs on 26 vertices with crossing number 10 or 11 ⋮ The crossing number of locally twisted cubes \(L T Q_n\) ⋮ A crossing lemma for multigraphs ⋮ Note on \(k\)-planar crossing numbers ⋮ On crossing numbers of geometric proximity graphs ⋮ A successful concept for measuring non-planarity of graphs: The crossing number. ⋮ The number of crossings in multigraphs with no empty lens ⋮ On the decay of crossing numbers ⋮ A bipartite strengthening of the crossing Lemma ⋮ Crossing numbers of imbalanced graphs ⋮ General lower bounds for the minor crossing number of graphs ⋮ A Bipartite Strengthening of the Crossing Lemma ⋮ Degenerate crossing numbers ⋮ The number of crossings in multigraphs with no empty lens
This page was built for publication: New bounds on crossing numbers