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
Embeddings of 4-valent framed graphs into 2-surfaces
β Scribed by V. O. Manturov
- Book ID
- 111454776
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 2009
- Tongue
- English
- Weight
- 130 KB
- Volume
- 79
- Category
- Article
- ISSN
- 1064-5624
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Trees are a common structure to represent the intertask communication pattern of a parallel algorithm. In this paper, we consider the embedding of a complete binary tree in a star graph with the objective of minimizing congestion and dilation. We develop two embeddings: (i) a congestion-free, dilati
Anton Kotzig has shown that every connected 4-regular plane graph has an A-trail, that is an Euler trail in which any two consecutive edges lie on a common face boundary. We shall characterise the 4-regular plane graphs which contain two orthogonal A-trails, that is to say two A-trails for which no