The closed 2-cell embeddings of 2-connected doubly toroidal graphs
نویسندگان
چکیده
منابع مشابه
Closed 2-cell embeddings of graphs with no V8-minors
A closed 2-cell embedding of a graph embedded in some surface is an embedding such that each face is bounded by a cycle in the graph. The strong 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 graph without V8 (the M obius 4-ladder) as a minor has a closed 2-cell embedding in some surface. As a c...
متن کاملClosed 2-cell embeddings of 4 cross-cap embeddable graphs
The strong embedding conjecture states that every 2-connected graph has a closed 2-cell embedding in some surface , i . e . an embedding that each face is bounded by a circuit in the graph . A graph is called k -crosscap embeddable if it can be embedded in the surface of non-orientable genus k . We confirm the strong embedding conjecture for 5-crosscap embeddable graphs . As a corollary , every...
متن کاملDoubly Even Orientable Closed 2-cell Embeddings of the Complete Graph
For all m > 1 and k > 2, we construct closed 2-cell embeddings of the complete graph K8km+4k+1 with faces of size 4k in orientable surfaces. Moreover, we show that when k > 3 there are at least (2m − 1)!/2(2m + 1) = 22mlog2m−O(m) nonisomorphic embeddings of this type. We also show that when k = 2 there are at least 1 4π 1 2m− 5 4 ( 4m e2 ) √ m (1− o(1)) nonisomorphic embeddings of this type.
متن کاملSeparating Cycles in Doubly Toroidal Embeddings
We show that every 4-representative graph embedding in the double torus contains a noncontractible cycle which separates the surface into two pieces. This improves a result of Zha and Zhao for general orientable surfaces, in which the same conclusion holds for 6-representative graph embeddings. Noncontractible separating cycles have been studied because they provide a way to do induction on the...
متن کاملEnumerating 2-cell Imbeddings of Connected Graphs
A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of connected graphs on closed orientable 2-manifolds. The method is applied to the wheel graphs and to the complete graphs. Congruence class genus polynomials and congruence class imbedding polynomials are introduced, to summarize important information refining the enumeration.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00040-p