Abstract
We identify the structures of 4-connected projective-planar graphs which generate their inequivalent embeddings on the projective plane, showing two series of graphs the number of whose inequivalent embeddings is held by O(n) with respect to the number of its vertices n. © 2010 Wiley Periodicals, Inc. J Graph Theory 68: 213-228, 2011 © 2011 Wiley Periodicals, Inc.
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 callDisclaimer: 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.
