2000 character limit reached
The crossing numbers of $K_m\times P_n$ and $K_m\times C_n$
Published 20 Nov 2012 in cs.DM | (1211.4641v1)
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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.