Improvement on the Crossing Number of Crossing-Critical Graphs

DOI10.1007/978-3-030-68766-3_29OpenAlexW3134774282MaRDI QIDQ5014130

János Barát, Géza Tóth

Publication date: 1 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/134534/1/s00454-020-00264-2.pdf

zbMATH Keywords

crossing numbergraph drawingcrossing critical

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Minimal graphs with crossing number at least \(k\)
• On a crossing number result of Richter and Thomassen
• On topological graphs with at most four crossings per edge
• On the decay of crossing numbers
• Characterizing 2-crossing-critical graphs
• Nearly light cycles in embedded graphs and crossing-critical graphs

This page was built for publication: Improvement on the Crossing Number of Crossing-Critical Graphs