Computing the orientable genus of projective graphs

Abstract

Abstract The orientable genus is determined for any graph that embeds into the projective plane, Σ, to be essentially half of the representativity of any embedding into Σ. In addition, a structure is given for any 3‐connected projective planar graph as the union of a spanning planar graph and a variation of a Möbius Ladder. © 1995 John Wiley & Sons, Inc.