The crossing numbers of $K_{n,n}-nK_2$, $K_{n}\times P_2$, $K_{n}\times P_3$ and $K_n\times C_4$
Abstract
The crossing number of a graph $G$ is the minimum number of pairwise intersections of edges among all drawings of $G$. In this paper, we study the crossing number of $K_{n,n}-nK_2$, $K_n\times P_2$, $K_n\times P_3$ and $K_n\times C_4$.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2012
- DOI:
- 10.48550/arXiv.1211.4437
- arXiv:
- arXiv:1211.4437
- Bibcode:
- 2012arXiv1211.4437Y
- Keywords:
-
- Computer Science - Discrete Mathematics;
- Mathematics - Combinatorics
- E-Print:
- 14 pages, 33 figures