Abstract
It is proved that every 3-connected loopless multigraph has maximum genus at least one-third of its cycle rank plus one if its cycle rank is not less than ten, and if its cycle rank is less than ten, it is upper-embeddable. This lower bound is tight. There are infinitely many 3-connected loopless multigraphs attaining this bound.
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 callMore From: Applied Mathematics-A Journal of Chinese Universities
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.
