The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph (Q1640218)

Summary: A plane drawing of a graph is \textit{cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoints) any of these circles. The cylindrical crossing number of a graph \(G\) is the minimum number of crossings in a cylindrical drawing of \(G\). In his influential survey on the variants of the definition of the crossing number of a graph, \textit{M. Schaefer} [Electron. J. Comb. DS21, 90 p. (2013; Zbl 1267.05180)] lists the complexity of computing the cylindrical crossing number of a graph as an open question. In this paper, we prove that the problem of deciding whether a given graph admits a cylindrical embedding is NP-complete, and as a consequence we show that the \(t\)-cylindrical crossing number problem is also NP-complete. Moreover, we show an analogous result for the natural generalization of the cylindrical crossing number, namely the \(t\)-crossing number.