A survey of graphs with known or bounded crossing numbers

2019/01/16 by Clancy, Kieran, Haythorpe, Michael, Newcombe, Alex
#05C10 #68R10 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1901.05155

Abstract

We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph families, results for graphs arising from various graph products, and results for recursive graph constructions.

Related

• New Bounds on the Biplanar and k-Planar Crossing Numbers
• Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach
• Crossing Numbers of Beyond-Planar Graphs
• Generalizations of the Crossing Lemma
• On a conjecture of Pach-Spencer-Tóth for graph crossing numbers