Improvement on the crossing number of crossing-critical graphs

DOI10.1007/s00454-020-00264-2OpenAlexW3118229782MaRDI QIDQ2117357

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

Publication date: 21 March 2022

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

crossing numbergraph drawingcrossing critical

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

New upper bounds for the crossing numbers of crossing-critical graphs

Cites Work

• 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
• Crossing Numbers of Graphs
• Unnamed Item

This page was built for publication: Improvement on the crossing number of crossing-critical graphs