A basic problem in graph embedding theory is to determine distinct embeddings of planar graphs on higher surfaces. Tutte’s work on graph connectivity shows that wheels or wheel-like configurations plays a key role in 3-connected graphs. In this paper we investigate the flexibility of a Halin grap on N1, the projective plane, and show that embeddings of a Halin graph on N1 is determined by making either a twist or a 3-patchment of a vertex in a wheel. Further more, as applications, we give a correspondence between a Halin graph and its embeddings on the projective plane. Based on this, the numbers of some types of such embeddings are determined
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to ...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
We derive an O(n2)-time algorithm for calculating the genus distribution of a given 3-regular Halin ...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
AbstractWhitney's theorem states that 3-connected planar graphs admit essentially unique embeddings ...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
Two embeddings psi(1) and psi(2) of a graph G in a surface Sigma are equivalent if there is a homeom...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
A Halin graph is a graph H = T C, where T is a tree with no vertex of degree two, and C is a cycle c...
A Halin graph is a graph H = T C, where T is a tree with no vertex of degree two, and C is a cycle c...
Abstract. A point-set embedding of a plane graph G with n vertices on a set S of n points is a strai...
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 Σ...
We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to ...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
We derive an O(n2)-time algorithm for calculating the genus distribution of a given 3-regular Halin ...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
AbstractWhitney's theorem states that 3-connected planar graphs admit essentially unique embeddings ...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
Two embeddings psi(1) and psi(2) of a graph G in a surface Sigma are equivalent if there is a homeom...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
A Halin graph is a graph H = T C, where T is a tree with no vertex of degree two, and C is a cycle c...
A Halin graph is a graph H = T C, where T is a tree with no vertex of degree two, and C is a cycle c...
Abstract. A point-set embedding of a plane graph G with n vertices on a set S of n points is a strai...
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 Σ...
We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to ...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...