1. Graduate School of Science and Technology, Niigata University, 8050 Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-2181, Japan;2. Department of Mathematics, Niigata University, 8050 Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-2181, Japan
Abstract:
A graph is 1-embeddable on a closed surface if there exists a drawing of the graph on the surface such that each edge crosses at most one other edge at a point. In this paper, we determine all the 1-embeddable complete k-partite graphs on the projective plane.