pith. sign in

arxiv: 1211.4641 · v1 · pith:JLECA4G3new · submitted 2012-11-20 · 💻 cs.DM

The crossing numbers of K_mtimes P_n and K_mtimes C_n

classification 💻 cs.DM
keywords timescrossingnumbernumbersdrawingedgesgraphintersections
0
0 comments X
read the original 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$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.