The closed 2-cell embeddings of 2-connected doubly toroidal graphs
β Scribed by Xiaoya Zha
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 711 KB
- Volume
- 145
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 doubly toroidal graph G has a closed 2-cell embedding in some surface. As a corollary, such a graph has a cycle double cover; i.e., G has a set of circuits containing every edge exactly twice.
π SIMILAR VOLUMES
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
Given a connected graph G, denote by V the family of all the spanning trees of G. Define an adjacency relation in V as follows: the spanning trees t and t$ are said to be adjacent if for some vertex u # V, t&u is connected and coincides with t$&u. The resultant graph G is called the leaf graph of G.
Let G be a 2-connected d-regular graph on n rd (r 3) vertices and c(G) denote the circumference of G. Bondy conjectured that c(G) 2nΓ(r&1) if n is large enough. In this paper, we show that c(G) 2nΓ(r&1)+2(r&3)Γ(r&1) for any integer r 3. In particular, G is hamiltonian if r=3. This generalizes a resu