scientific article; zbMATH DE number 1054768
From MaRDI portal
Publication:4352316
zbMath0890.05022MaRDI QIDQ4352316
László A. Székely, Farhad Shahrokhi, Imrich Vrt'o, Ondrej Sýkora
Publication date: 7 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Algorithms for the fixed linear crossing number problem, Crossing number, pair-crossing number, and expansion, Improvement on the decay of crossing numbers, The outerplanar crossing number of the complete bipartite graph, The crossing number of locally twisted cubes \(L T Q_n\), Planar crossing numbers of graphs of bounded genus, A successful concept for measuring non-planarity of graphs: The crossing number., On the Erdős distinct distances problem in the plane, Approximating the fixed linear crossing number, On the decay of crossing numbers, Crossing number and weighted crossing number of near-planar graphs, An analysis of some linear graph layout heuristics, An improved upper bound on the crossing number of the hypercube, Crossing and Weighted Crossing Number of Near-Planar Graphs, Improvement on the Decay of Crossing Numbers, The bipartite-cylindrical crossing number of the complete bipartite graph, A new lower bound for the bipartite crossing number with applications, Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill, Which crossing number is it anyway?
