Adjacent Crossings Do Matter

DOI10.1007/978-3-642-25878-7_33zbMath1311.68118OpenAlexW2240846442MaRDI QIDQ5895517

Daniel Štefanković, Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer

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_33

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Crossing lemma for the odd-crossing number

Cites Work

• Unnamed Item
• Unnamed Item
• Crossing numbers of graphs with rotation systems
• Removing even crossings
• Note on the pair-crossing number and the odd-crossing number
• Removing even crossings on surfaces
• A successful concept for measuring non-planarity of graphs: The crossing number.
• Which crossing number is it anyway?
• Odd crossing number and crossing number are not the same
• A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
• Hanani–Tutte, Monotone Drawings, and Level-Planarity
• Research Problems in Discrete Geometry
• An optimality criterion for the crossing number
• Strong Hanani–Tutte on the Projective Plane
• Towards an implementation of the 3D visibility skeleton
• Removing Independently Even Crossings
• Toward a theory of crossing numbers

This page was built for publication: Adjacent Crossings Do Matter