Abstract
Let ω: Ḡ→G be a wrapped covering of graphs and let G be enbedded in a surface S. It is known that if the embedding of G in S is orientable, then this embedding may be lifted to an orientable embedding of Ḡ in S̄. In this paper, we generalize this result by showing that the embedding of G in S may be lifted to an embedding of Ḡ in S̄, where S̄ has the same orientability characteristic as that of S. Furthermore, ω extends to a branched covering B:S̄→S of surfaces and the restriction of B to the dual of Ḡ is a wrapped covering onto the dual of G. These results were applied to obtain genus embeddings of composition graphs G[K̄n] from embeddings of the graph G.
| Original language | English |
|---|---|
| Pages (from-to) | 11-23 |
| Number of pages | 13 |
| Journal | Discrete Mathematics |
| Volume | 78 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - 1989 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Generalizing the duality theorem of graph embeddings'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver