Re-embedding of projective-planar graphs

Seiya Negami
1988 Journal of combinatorial theory. Series B (Print)  
In this paper, we characterize those projective-plane 3-connected graphs which admit re-embeddings in a projective plane different from their original one. The results will be applied for analysis of the uniqueness and faithfulness of the embedding of Sconnected projective-planar graphs.
doi:10.1016/0095-8956(88)90037-8 fatcat:vdviiqx3ebhl5eaxzgyoef3gw4