Note on \(k\)-planar crossing numbers

DOI10.1016/j.comgeo.2017.06.015zbMath1380.05165arXiv1611.05746OpenAlexW2556063533MaRDI QIDQ1699274

Csaba D. Tóth, László A. Székely, Géza Tóth, János Pach

Publication date: 19 February 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.05746

zbMATH Keywords

crossing numbergeometric graphgraph decomposition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Parameterized analysis and crossing minimization problems ⋮ On the 2-colored crossing number ⋮ On the \(k\)-planar local crossing number ⋮ Testing gap \(k\)-planarity is NP-complete

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving the crossing lemma by finding more crossings in sparse graphs
• On \(k\)-planar crossing numbers
• Graphs drawn with few crossings per edge
• The thickness of graphs: A survey
• Biplanar graphs: A survey
• A successful concept for measuring non-planarity of graphs: The crossing number.
• New bounds on crossing numbers
• The graph crossing number and its variants: a survey
• Geometric biplane graphs. I: Maximal graphs
• Thickness and coarseness of graphs
• Thickness and Colorability of Geometric Graphs
• Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
• Determining the thickness of graphs is NP-hard
• Bounds for rectilinear crossing numbers
• The Non-Biplanar Character of the Complete 9-Graph
• Every planar graph with nine points has a nonplanar complement

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