𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Closed 2-cell embeddings of 4 cross-cap
✍ Xiaoya Zha πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 874 KB

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

Congestion-free, dilation-2 embedding of
✍ Tseng, Yu-Chee; Chen, Yuh-Shyan; Juang, Tong-Ying; Chang, Chiou-Jyu πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 291 KB πŸ‘ 2 views

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

Orthogonal A-Trails of 4-Regular Graphs
✍ Lars DΓΈvling Andersen; AndrΓ© Bouchet; Bill Jackson πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 390 KB

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