On \(k\)-planar crossing numbers

DOI10.1016/j.dam.2005.12.011zbMath1121.05039OpenAlexW1970611748MaRDI QIDQ885282

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

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

complete bipartite graphlower boundcrossing numbercomplete graph\(k\)-planar crossing numberrectilinear \(k\)-planar crossing number

Mathematics Subject Classification ID

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

Related Items

Parameterized analysis and crossing minimization problems ⋮ Book embeddings and crossing numbers ⋮ Improved bounds for the crossing numbers on surfaces of genus g ⋮ Note on \(k\)-planar crossing numbers ⋮ On the 2-colored crossing number ⋮ Book drawings of complete bipartite graphs ⋮ On the \(k\)-planar local crossing number ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multilayer grid embeddings for VLSI
• Decompositions of graphs into forests with bounded maximum degree
• Forests, frames, and games: Algorithms for matroid sums and applications
• Edge-Disjoint Spanning Trees of Finite Graphs
• Geometric Thickness of Complete Graphs
• The book crossing number of a graph
• The toroidal crossing number of the complete graph
• The crossing number of K5,n