## Abstract Let __G__ be a 3‐connected planar graph and __G__^\*^ be its dual. We show that the pathwidth of __G__^\*^ is at most 6 times the pathwidth of __G__. We prove this result by relating the pathwidth of a graph with the cut‐width of its medial graph and we extend it to bounded genus embedd
A duality theorem for graph embeddings
✍ Scribed by Brad Jackson; T. D. Parsons; Tomaž Pisanski
- Publisher
- John Wiley and Sons
- Year
- 1981
- Tongue
- English
- Weight
- 918 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A generalized type of graph covering, called a “Wrapped quasicovering” (wqc) is defined. If K, L are graphs dually embedded in an orientable surface S, then we may lift these embeddings to embeddings of dual graphs K̃,L̃ in orientable surfaces S̃, such that S̃ are branched covers of S and the restrictions of the branched coverings to K̃,L̃ are wqc's of K, L. the theory is applied to obtain genus embeddings of composition graphs G[nK~1~] from embeddings of “quotient” graphs G.
📜 SIMILAR VOLUMES
Siraii, J., Duke's theorem does not extend to signed graph embeddings, Discrete Mathematics, 94 (1991) 233-238. Using homology-type arguments and surface surgery it is proved that a direct extension of the classical Duke's contiguity theorem to cellular orientation embeddings of signed graphs is imp