Abstract
Total embedding distributions have been known for only a few classes of graphs. In this paper the total embedding distributions of the cacti and the necklaces are obtained. Furthermore we obtain the total embedding distributions of all graphs with maximum genus 1 by using the method of this paper.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gross, J., Robbins, D. P., Tucker, T. W.: Genus distributions for bouquets of circles. J. Combin Theory Ser., B47, 292–306 (1989)
Gross, J., Klein, E., Rieper, R.: On the average genus of a graph. Graphs Combin., 9, 153–162 (1993)
Furst. M. L., Gross, J., Statman, R.: Genus distributions for two classes of graphs. J. Combin. Theory Ser. B, 46, 22–36 (1989)
Tesar, E. H.: Genus distribution of Ringel ladders. Discrete Math., 216, 235–252 (2000)
Chen, J., Gross, J., Rieper, R. G: Overlap matrices and total embeddings. Discrete Math., 128, 73–94 (1994)
Mohar, B.: An obstruction to embedding graphs in surface. Discrete Math., 78, 135–142 (1989)
Kwak, J., Shim, S.: Total embedding distributions for bouquets of circles. Discrete Math., 248, 93–108 (2002)
Chen, J., Gross, J.: Limit points for average genus (II), 2–Connected non–simplicial graphs. J. Combin. Theory, B56, 108–129 (1992)
Chen, J., Gross, J.: Kuratowski–type theorems for average genus. J. Combin. Theory, B57, 100–121 (1993)
Stahl, S.: Generalized embedding schemes. J. Graph Theory, 2, 41–52 (1978)
Liu, Y. P.: Embeddability in Graphs, Kluwer, Dordrecht/Boston/London, 1995
Liu, Y. P.: Advances in Combinatorial Maps, Northern Jiaotong University Press, 2003
White, A. T.: Graphs, Groups and Surfaces, 2nd Edition, Elsevier, Amsterdam, 1984
Nordhaus, E. A., Ringeisen, R. D., Stewart, B. M., White, A. T.: A Kuratowski type theorem for the maximum genus of a graph. J. Combin. Theory, B12, 260–267 (1972)
Gross, J., Furst, M. L.: Hierarchy for imbedding–disbritution invariants of a graph. J. Graph Theory, 11, 205–220 (1987)
Chen, Y. C., Liu, Y. P.: A tight Lower bound for the average crosscap number. Submitted
Chen, J., Gross, J.: Limit points for average genus (I), 3–Connected and 2–Connected Simplicial Graphs. J. Combin. Theory, B55, 83–103 (1992)
Stahl, S.: On the zeros of some genus polynomials. Can. J. Math., 49, 617–640 (1997)
Cai, J. L., Liu, Y. P.: The Enumeration of General Rooted Planar Maps. Acta Mathematica Sinica, English Series, 21(1), 215–224 (2005)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by by NNSFC under Grant No. 60373030 and found of Beijing JiaoTong Univeristy under Grant No. 2004SM054
Rights and permissions
About this article
Cite this article
Chen, Y.C., Liu, Y.P. & Wang, T. The Total Embedding Distributions of Cacti and Necklaces. Acta Math Sinica 22, 1583–1590 (2006). https://doi.org/10.1007/s10114-005-0856-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10114-005-0856-2