Squares in .
In this note we give a simple proof of a result of Richter and Siran by basic counting method, which says that the crossing number of in a surface with Euler genus ε is ⎣n/(2ε+2)⎦ n - (ε+1)(1+⎣n/(2ε+2)⎦).
In this paper we prove that the projective plane crossing number of the circulant graph C(3k;{1,k}) is k-1 for k ≥ 4, and is 1 for k = 3.
Page 1