The crossing numbers of K_(n,n)-nK₂, K_(n)times P₂, K_(n)times P₃ and K_ntimes C₄
classification
💻 cs.DM
math.CO
keywords
timescrossingnumberdrawingsedgesgraphintersectionsminimum
read the original 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$.
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.