Year-end Sale % OFF 
Abstract
Graphs of small average genus are characterized. In particular, a Kuratowski-type theorem is obtained: except for finitely many graphs, a cutedge-free graph has average genus less than or equal to 1 if and only if it is a necklace. We provide a complete list or those exceptions. A Kuratowski-type theorem for graphs of maximum genus 1 is also given. Some of the methods used in obtaining these results involve variations of a classical result of Whitney.
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.
