On the \(k\)-planar local crossing number

DOI10.1016/j.disc.2018.11.020zbMath1405.05140arXiv1804.02117OpenAlexW2962838183MaRDI QIDQ1727762

Arran Hamm, John Asplund, Vishesh Jain, Thao T. Do

Publication date: 20 February 2019

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

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

zbMATH Keywords

probabilistic method\(k\)-planar crossing number\(k\)-planar local crossing numbercrossing number inequality

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Testing gap \(k\)-planarity is NP-complete

Cites Work

• 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
• Note on \(k\)-planar crossing numbers
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
• New lower bound techniques for VLSI
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Crossing Numbers of Graphs
• Probability Inequalities for Sums of Bounded Random Variables
• Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard

This page was built for publication: On the \(k\)-planar local crossing number