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.
Original language | English |
---|---|
Pages (from-to) | 209-296 |
Number of pages | 88 |
Journal | Australasian Journal of Combinatorics, the |
Volume | 78 |
Issue number | 2 |
Publication status | Published - Oct 2020 |
Bibliographical note
c The author(s). Released under the CC BY 4.0 International LicenseKeywords
- graphs
- bounded crossing numbers
- known crossing numbers
- recursive graph constructions
- graph families