Hostname: page-component-669899f699-rg895 Total loading time: 0 Render date: 2025-04-26T22:25:30.578Z Has data issue: false hasContentIssue false
  • English
  • Français

Incongruent embeddings of a bouquet into surfaces

Published online by Cambridge University Press:  17 April 2009

Jin Hwan Kim  and
Young Kou Park
Jin Hwan Kim
Affiliation:
Department of Mathematics Education, Yeungnam University, Kyongsan 712–749, Korea, e-mail: [email protected]
Young Kou Park
Affiliation:
Department of Mathematics, Yeungnam University, Kyongsan 712–749, Korea, e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Two 2-cell embeddings i, j of a graph G into surfaces  and ′ are said to be congruent with respect to a subgroup Γ of Aut(G) if there are a homeomorphism h:  → ′ and an automorphism γ ∈ Γ such that h ∘ i = j ∘ γ. In this paper, we compute the total number of congruence classes of 2-cell embeddings of any bouquet of circles into surfaces with respect to a group consisting of graph automorphisms of a bouquet.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 61 , Issue 1 , February 2000 , pp. 89 - 96
Copyright
Copyright © Australian Mathematical Society 2000

References

REFERENCES

[1]Kwak, J.H. and Lee, J., ‘Enumeration of graph embeddings’, Discrete Math. 135 (1994), 129–151.CrossRefGoogle Scholar
[2]Mull, B.P., Rieper, R.G. and White, A.T., ‘Enumerating 2-cell embeddings of connected graphs’, Proc. Amer. Soc. 103 (1988), 321–330.CrossRefGoogle Scholar
[3]Stahl, S., ‘Generalized embedding schemes’, J. Graph Theory 2 (1978), 41–52.CrossRefGoogle Scholar