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.
|Number of pages||15|
|Publication status||Accepted/In press - Jun 2021|
|Name||Journal of Combinatorial Mathematics and Combinatorial Computing|