Polyhedral embeddings in the projective plane (Q1178342): Difference between revisions

A purely graph theoretic necessary and sufficient condition is given for a graph \(G\) to admit a polyhedral embedding (i.e. one inducing a polyhedral map) into the real projective plane. This condition is that \(G\) is 3-connected and \(G-v\) is nonplanar for every vertex \(v\) of \(G\). As a corollary it follows: If \(G\) admits a polyhedral embedding into the real projective plane, then every embedding is polyhedral.