Supported by the National Natural Science Foundation of China(Granted No.10271048,10671073);Supported by Science and Technology Commission of Shanghai Municipality(Granted No.07XD14011
Supported by the National Natural Science Foundation of China (Grant No.10671073);Science and Technology Commission of Shanghai Municipality (Grant No.07XD14011)
In this paper, we discuss the crossing numbers of two one-vertex maps on orientable surfaces. By using a reductive method, we give the crossing number of two one-vertex maps with one face on an orientable surface and ...
Supported by the National Natural Science Foundation of China (Grant No.10671073);the Science and Technology Commission of Shanghai Municipality (Grant No.07XD14011)
It is well known that finding the crossing number of a graph on nonplanar surfaces is very difficult.In this paper we study the crossing number of the circular graph C(10,4) on the projective plane and determine the...