Relative Embeddings of Graphs on Closed Surfaces
✍ Scribed by Jozef Širáň; Martin Škoviera
- Publisher
- John Wiley and Sons
- Year
- 1988
- Tongue
- English
- Weight
- 726 KB
- Volume
- 136
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We show that every 3-connected planar graph has a circular embedding in some nonspherical surface. More generally, we characterize those planar graphs that have a 2-representative embedding in some nonspherical surface. This is proved in Section 3. Standard results in the theory show that it suffic
A closed 2-cell embedding of a graph embedded in some surface is an embedding such that each face is bounded by a circuit in the graph. The strong embedding conjecture says that every 2-connected graph has a closed 2-cell embedding in some surface. A graph is called k cross-cap embeddable if it can
A closed 2-cell embedding of a graph embedded in some surface is an embedding such that each face is bounded by a circuit in the graph. The closed 2-cell embedding conjecture says that every 2-connected graph has a closed 2-cell embedding in some surface. In this paper, we prove that any 2-connected