Crossing lemma for the odd-crossing number

DOI10.1016/j.comgeo.2022.101901zbMath1498.05191arXiv2208.12140OpenAlexW4281748286WikidataQ114195491 ScholiaQ114195491MaRDI QIDQ2088881

János Karl, Géza Tóth

Publication date: 6 October 2022

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

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

zbMATH Keywords

crossing lemmaodd-crossing number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Improving the crossing lemma by finding more crossings in sparse graphs
• Removing even crossings
• Note on the pair-crossing number and the odd-crossing number
• Graphs drawn with few crossings per edge
• A successful concept for measuring non-planarity of graphs: The crossing number.
• Which crossing number is it anyway?
• On topological graphs with at most four crossings per edge
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Odd crossing number and crossing number are not the same
• A Crossing Lemma for the Pair-Crossing Number
• New lower bound techniques for VLSI
• Crossing-Free Subgraphs
• Über wesentlich unplättbare Kurven im dreidimensionalen Raume
• Adjacent Crossings Do Matter

This page was built for publication: Crossing lemma for the odd-crossing number