On the Crossing Numbers of Cartesian Products of Small Graphs with Paths, Cycles and Stars

Research output: Contribution to journalArticlepeer-review

7 Downloads (Pure)

Abstract

There has been significant research dedicated towards computing the crossing numbers of families of graphs resulting from the Cartesian products of small graphs with arbitrarily large paths, cycles and stars. For graphs with four or fewer vertices, these have all been computed, but there are still various gaps for graphs with five or more vertices. We contribute to this field by determining the crossing numbers for fifteen such families.

Original languageEnglish
Pages (from-to)323-333
Number of pages11
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Volume119
DOIs
Publication statusPublished - 31 Mar 2024

Keywords

  • Cartesian Product
  • Crossing Number
  • Cycle
  • Path
  • Small Graphs
  • Star

Fingerprint

Dive into the research topics of 'On the Crossing Numbers of Cartesian Products of Small Graphs with Paths, Cycles and Stars'. Together they form a unique fingerprint.

Cite this