A survey of graphs with known or bounded crossing numbers

Kieran Clancy, Michael Haythorpe, Alex Newcombe

Research output: Contribution to journalArticle

1 Downloads (Pure)

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 families.
Original languageEnglish
Pages (from-to)209-296
Number of pages88
JournalAustralasian Journal of Combinatorics, the
Volume78
Issue number2
Publication statusPublished - Oct 2020

Bibliographical note

c The author(s). Released under the CC BY 4.0 International License

Keywords

  • graphs
  • bounded crossing numbers
  • known crossing numbers
  • recursive graph constructions
  • graph families

Fingerprint Dive into the research topics of 'A survey of graphs with known or bounded crossing numbers'. Together they form a unique fingerprint.

  • Cite this