๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Uniform strong 2-cell imbeddings of bridgeless graphs

โœ Scribed by Bruce P. Mull; Dionysios Kountanis; Reza Rashidi

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
714 KB
Volume
143
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Enumerating the orientable 2-cell imbedd
Enumerating the orientable 2-cell imbeddings of complete bipartite graphs
โœ Mull, Bruce P. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 153 KB ๐Ÿ‘ 2 views

A formula is developed for the number of congruence classes of 2cell imbeddings of complete bipartite graphs in closed orientable surfaces.

The closed 2-cell embeddings of 2-connec
The closed 2-cell embeddings of 2-connected doubly toroidal graphs
โœ Xiaoya Zha ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 711 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 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

Closed 2-cell embeddings of 4 cross-cap
Closed 2-cell embeddings of 4 cross-cap embeddable graphs
โœ 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