Note on the pair-crossing number and the odd-crossing number

DOI10.1007/s00454-007-9024-zzbMath1154.05318OpenAlexW2024280488WikidataQ114229319 ScholiaQ114229319MaRDI QIDQ938304

Géza Tóth

Publication date: 19 August 2008

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-007-9024-z

zbMATH Keywords

Crossing numberDrawings of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Monotone Crossing Number ⋮ On the Pseudolinear Crossing Number ⋮ Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) ⋮ Crossing Numbers and Parameterized Complexity ⋮ Adjacent Crossings Do Matter ⋮ Crossing lemma for the odd-crossing number

Cites Work

• Which crossing number is it anyway?
• Decidability of string graphs
• Toward a theory of crossing numbers
• Graph Drawing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on the pair-crossing number and the odd-crossing number