𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Existence of Polyhedral Embeddings of Graphs

✍ Scribed by Bojan Mohar


Publisher
Springer-Verlag
Year
2001
Tongue
English
Weight
142 KB
Volume
21
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On self duality of pathwidth in polyhedr
✍ Fedor V. Fomin; Dimitrios M. Thilikos πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 211 KB

## 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

Embeddings of graphs
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 861 KB
Embeddings of bipartite graphs
✍ Mohammed Abu-Sbeih; T. D. Parsons πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 458 KB
Embeddings of infinite graphs
✍ Bojan Mohar πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 919 KB
Projective plane embeddings of polyhedra
✍ Adrian Riskin πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 607 KB

We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to be embeddable in the projective plane. Our other main result is that even if the graph of a polyhedral map in the pinched torus is embeddable in a projective plane, the map induced by the embedding ca