"A graph ＄G＄ is said to be uniquely embeddable in a surface ＄F^{2}＄ if for any two embeddings ＄f_{1},f_{2}＄ : ＄G￥rightarrow F^{2}＄, there is an automorphism ＄￥sigma＄ : ＄G￥rightarrow G＄ and a homeomorphism ＄h;F^{2}￥rightarrow F^{2}＄ such that ＄ h_{￥circ}f_{1}=f_{2}￥circ￥sigma＄ . A graph ＄G＄ is said to be faithfully embeddable in a surface ＄F^{2}＄ if ＄G＄ admits an embedding ＄f:G￥rightarrow F^{2}＄ such that for any automorphism ＄￥sigma:G￥rightarrow G＄ , there is a homeomorphism ＄h＄ ; ＄F^{2}￥rightarrow F^{2}＄ with ＄ h_{0}f=f￥circ￥sigma＄ . Given a hyperbolic closed surface ＄F^{2}＄, an infinite number of 6-connected graphs which are not uniquely or not faithfully embeddable in ＄F^{2}＄ will be constructed systematically.
AbstractThe basic topological facts about closed curves in R2 and triangulability of surfaces are us...
AbstractLet G be a 5-connected graph not isomorphic to the complete graph K6 with 6 vertices and tri...
AbstractWe generalize Kasteleyn's method of enumerating the perfect matchings in a planar graph to g...
AbstractA topological generalization of the uniqueness of duals of 3-connected planar graphs will be...
Flötotto A. Embeddability of graphs into the Klein surface. Bielefeld (Germany): Bielefeld Universit...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of ...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
Two embeddings psi(1) and psi(2) of a graph G in a surface Sigma are equivalent if there is a homeom...
AbstractBy a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compac...
AbstractBy a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compac...
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
AbstractA topological generalization of the uniqueness of duals of 3-connected planar graphs will be...
AbstractThe basic topological facts about closed curves in R2 and triangulability of surfaces are us...
AbstractLet G be a 5-connected graph not isomorphic to the complete graph K6 with 6 vertices and tri...
AbstractWe generalize Kasteleyn's method of enumerating the perfect matchings in a planar graph to g...
AbstractA topological generalization of the uniqueness of duals of 3-connected planar graphs will be...
Flötotto A. Embeddability of graphs into the Klein surface. Bielefeld (Germany): Bielefeld Universit...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of ...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
Two embeddings psi(1) and psi(2) of a graph G in a surface Sigma are equivalent if there is a homeom...
AbstractBy a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compac...
AbstractBy a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compac...
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
AbstractA topological generalization of the uniqueness of duals of 3-connected planar graphs will be...
AbstractThe basic topological facts about closed curves in R2 and triangulability of surfaces are us...
AbstractLet G be a 5-connected graph not isomorphic to the complete graph K6 with 6 vertices and tri...
AbstractWe generalize Kasteleyn's method of enumerating the perfect matchings in a planar graph to g...
Add to ORKG