On stable crossing numbers
Paul C. Kainen, Arthur T. White · Journal of Graph Theory · 1978
Abstract Results giving the exact crossing number of an infinite family of graphs on some surface are very scarce. In this paper we show the following: for G = Qn × K4.4, cry(G)‐m(G) = 4m, for 0 ⩽ = m ⩽ 2n. A generalization is obtained, for certain repeated cartesian products of bipartite graphs. Nonorientable analogs are also developed.