The crossing numbers of products of a 5-vertex graph with paths and cycles
Marián Klešč · Discussiones Mathematicae Graph Theory · 1999
There are several known exact results on the crossing numbers of Cartesian products of paths, cycles or stars with “small” graphs. Let H be the 5-vertex graph defined from K5 by removing three edges incident with a common vertex. In this paper, we extend the earlier results to the Cartesian products of H ×Pn and H ×Cn, showing that in the general case the corresponding crossing numbers are 3n−1, and 3n for even n or 3n + 1 if n is odd.