Improved upper bounds on the crossing number
From MaRDI portal
Publication:3602937
DOI10.1145/1377676.1377739zbMath1271.05027OpenAlexW2126719142MaRDI QIDQ3602937
Vida Dujmović, David R. Wood, Bojan Mohar, Ken-ichi Kawarabayashi
Publication date: 12 February 2009
Published in: Proceedings of the twenty-fourth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1377676.1377739
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)
Related Items (3)
On crossing numbers of geometric proximity graphs ⋮ A Golden Ratio Inequality for Vertex Degrees of Graphs ⋮ The Effect of Planarization on Width
This page was built for publication: Improved upper bounds on the crossing number
