Re-embedding structures of 5-connected projective-planar graphs (Q1349089)

The authors give the structures of 5-connected projective-planar graphs which generate their inequivalent imbeddings on the projective plane and also a short proof of a result of the first author [Ph.D. Dissertation, Tokyo Institute of Technology (1992)] that every 5-connected graph of nonorientable genus 1 has exactly 1, 2, 3, 4, 6, 9, or 12 inequivalent imbeddings on the projective plane (the ``12'' is attained by \(K_6\) uniquely).