Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.