Monotone Crossing Number

DOI10.1007/978-3-642-25878-7_27zbMath1271.05066OpenAlexW1550020410MaRDI QIDQ3223961

János Pach, Géza Tóth

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_27

zbMATH Keywords

crossing numbermonotone drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Twisted ways to find plane structures in simple drawings of complete graphs ⋮ Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on the pair-crossing number and the odd-crossing number
• Some simplified NP-complete graph problems
• Which crossing number is it anyway?
• Odd crossing number and crossing number are not the same
• A Better Bound for the Pair-Crossing Number
• Hanani–Tutte, Monotone Drawings, and Level-Planarity
• Conway’s Conjecture for Monotone Thrackles
• Crossing Number is NP-Complete
• Towards an implementation of the 3D visibility skeleton
• Bounds for rectilinear crossing numbers
• Removing Independently Even Crossings
• Toward a theory of crossing numbers
• Crossing Number Problems

This page was built for publication: Monotone Crossing Number