Abstract
Let G be a 3-edge-connected graph (possibly with multiple edges or loops), and let γ M (G) and β(G) be the maximum genus and the Betti number of G, respectively. Then γ M (G) can be proved and this answers a question posed by Chen, et al. in 1996.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Liu Yanpei, Embeddability in Graphs, Science Press, Beijing, Kluwer Academic Press, London, 1995.
Nordhaus, E., Stewart, B., White, A., On the maximum genus of a graph, J. Combin. Theory Ser. B, 1979, 11:258–267.
Xuong, N. H., How to determine the maximum genus of a graph, J. Combin. Theory Ser. B, 1979, 26:217–225.
Jungerment, M., A characterization of upper embeddable graphs, Trans. Amer. Math. Soc., 1978, 214:401–406.
Chen, J., Archdeacon, D. and Gross, J. L., A tight lower bound on the maximum genus of a simplicial graph, Discrete Math., 1996, 156:83–102.
Chen, J., Archdeacon, D. and Gross, J. L. Maximum genus and connectivity, Discrete Math., 1996, 149:19–29.
Kanchi, S. P. and Chen, J., A tight lower bound on the maximum genus of a 2-connected simplicial graph, Manuscript, 1992.
Huang, Y., The maximum genus on a 3-vertex-connected graph, Graph and Combinatorics, 2000, 16:159–164.
Bondy, J. A. and Murty, U. S., Graph Theory Application, Macmillan, London and Elsevier, New York, 1979.
Nebesky, L., A new characterization of the maximum genus of graphs, Czechoslovak Math. J., 1981, 31(106):604–613.
Huang, Y. and Liu, Y., An improvement of a theorem on the maximum genus for graphs, Math. Appl., 1998, 11(2):109–112.
Author information
Authors and Affiliations
Additional information
Supported by NNSF of China (19801013).
Rights and permissions
About this article
Cite this article
Yuanqiu, H. A note on the maximum genus of 3-edge-connected nonsimple graphs. Appl. Math. Chin. Univ. 15, 247–251 (2000). https://doi.org/10.1007/s11766-000-0047-y
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11766-000-0047-y