On the Pseudolinear Crossing Number

DOI10.1002/jgt.22027zbMath1359.05085arXiv1404.7332OpenAlexW2208197305MaRDI QIDQ2978177

César Hernández-Vélez, Jesús Leaños, Gelasio Salazar

Publication date: 21 April 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

rectilinear crossing numbercrossing numberpseudoline arrangementspseudolinear crossing number

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

On the 2-colored crossing number ⋮ Complexity of Geometric k-Planarity for Fixed k

Cites Work

• Unnamed Item
• Unnamed Item
• Unexpected behaviour of crossing sequences
• Teilungen der Ebenen durch Geraden oder topologische Geraden
• Note on the pair-crossing number and the odd-crossing number
• Crossing-critical graphs with large maximum degree
• Proof of a conjecture of Burr, Grünbaum, and Sloane
• Some provably hard crossing number problems
• The graph crossing number and its variants: a survey
• Odd crossing number and crossing number are not the same
• Crossing Number is NP-Complete
• Complexity of Some Geometric and Topological Problems
• Bounds for rectilinear crossing numbers

This page was built for publication: On the Pseudolinear Crossing Number