The crossing numbers of $K_m\times P_n$ and $K_m\times C_n$

Abstract

The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. In this paper, we study the crossing numbers of $K_m\times P_n$ and $K_m\times C_n$.

16 pages, 30 figures