Abstract.
This paper shows that the lower bound on the maximum genus for a 3-vertex-connected graph G, which may have multiple edges and loops, is at least ⅓β(G). This answers the question posed by the authors in [9].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: January 16, 1997 Revised: May 22, 1998
Rights and permissions
About this article
Cite this article
Huang, Y. The Maximum Genus on a 3-Vertex-Connected Graph. Graphs Comb 16, 159–164 (2000). https://doi.org/10.1007/s003730070022
Issue Date:
DOI: https://doi.org/10.1007/s003730070022