On k-planar crossing numbers

DOI10.1016/J.DAM.2005.12.011MaRDI QIDQ885282zbMATH OpenOpenAlexFDO

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

Publication date 8 June 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.12.011

zbMATH Keywords

lower boundcomplete graphcomplete bipartite graphcrossing number\(k\)-planar crossing numberrectilinear \(k\)-planar crossing number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Graph Drawing
• Using block designs in crossing number bounds
• Note on \(k\)-planar crossing numbers
• The crossing number of 2-planar graphs and its application
• Computational search of small point sets with small rectilinear crossing number
• On the Decay of Crossing Numbers
• Computing crossing numbers in quadratic time
• Computing crossing numbers in quadratic time
• Crossing number, pair-crossing number, and expansion

Cites work

• scientific article; zbMATH DE number 1096962 (Why is no real title available?)
• scientific article; zbMATH DE number 837053 (Why is no real title available?)
• scientific article; zbMATH DE number 3329635 (Why is no real title available?)
• scientific article; zbMATH DE number 3195968 (Why is no real title available?)
• Biplanar crossing numbers. I: A survey of results and problems
• Decompositions of graphs into forests with bounded maximum degree
• Edge-Disjoint Spanning Trees of Finite Graphs
• Forests, frames, and games: Algorithms for matroid sums and applications
• Geometric Thickness of Complete Graphs
• Multilayer grid embeddings for VLSI
• The book crossing number of a graph
• The crossing number of K5,n
• The toroidal crossing number of the complete graph

Cited in

(21)

• Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
• The crossing number of 2-planar graphs and its application
• Note on \(k\)-planar crossing numbers
• scientific article; zbMATH DE number 2114110 (Why is no real title available?)
• On the \(k\)-planar local crossing number
• On the 2-colored crossing number
• Graph Drawing
• Book embeddings and crossing numbers
• \(k\)-planar graphs
• A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
• Using block designs in crossing number bounds
• Parameterized analysis and crossing minimization problems
• ON THE SATELLITE CROSSING NUMBER CONJECTURE
• New bounds on the biplanar crossing number of low-dimensional hypercubes: how low can you go?
• Gap-planar graphs
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Complexity of geometric \(k\)-planarity for fixed \(k\)
• Improved bounds for the crossing numbers on surfaces of genus g
• scientific article; zbMATH DE number 3865305 (Why is no real title available?)
• Book drawings of complete bipartite graphs
• \(k\)-planar crossing number of random graphs and random regular graphs

This page was built for publication: On \(k\)-planar crossing numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q885282)