Re-embedding structures of 5-connected projective-planar graphs Original Research Article

We shall identify the structures of 5-connected projective-planar graphs which generate their inequivalent embeddings on the projective plane and show a short proof of the result, due to Kitakubo [3], that every 5-connected projective-planar nonplanar graph has exactly 1, 2, 3, 4, 6, 9 or 12 inequivalent embeddings on the projective plane.