Improvement on the Decay of Crossing Numbers

DOI10.1007/978-3-540-77537-9_5zbMath1137.68460OpenAlexW2161184678MaRDI QIDQ5452206

Jan Kynčl, Géza Tóth, Jakub Černý

Publication date: 25 March 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_5

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 (3)

Improvement on the decay of crossing numbers ⋮ The crossing number of \(K_{5,n+1} \setminus e\) ⋮ Nested cycles in large triangulations and crossing-critical graphs

Cites Work

• Minimal graphs with crossing number at least \(k\)
• Improving the crossing lemma by finding more crossings in sparse graphs
• The Moore bound for irregular graphs
• On the Decay of Crossing Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improvement on the Decay of Crossing Numbers