AbstractIt is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere have a special structure. It turns out that these embeddings can be described in terms of noncontractible curves in the surface, meeting the graph in at most two points (which may taken to be vertices of the graph). The close connection between the homology group of the surface and the planar graph embeddings is perhaps the most interesting aspect of this study. Some important consequences follow from these results. For example, any two embeddings of a planar graph in the same surface can be obtained from each other by means of simple local reembeddings very similar to Whitney's switchings
AbstractWhitney [7] proved in 1932 that for any two embeddings of a planar 3-connected graph, their ...
AbstractWe survey some recent results on graphs embedded in higher surfaces or general topological s...
A planarizing set of a graph is a set of edges or vertices whose removal leaves a planar graph. It i...
AbstractIt is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere h...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
AbstractWe show that every 3-connected planar graph has a circular embedding in some nonspherical su...
A planar graph is a graph that can be drawn in such a way in the plane, so that no edges cross each ...
AbstractWe investigate the question of which graphs have planar emulators (a locally-surjective homo...
A planarizing set of a graph is a set of edges or vertices whose removal leaves a planar graph. It i...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
A graph Γ in a 3-manifold M is called planar if it is contained in an embedded 2-sphere in M. It is ...
Abstract. We investigate the question of which graphs have planar emulators (a locally-surjective ho...
AbstractWe show that every 3-connected planar graph has a circular embedding in some nonspherical su...
AbstractThe basic topological facts about closed curves in R2 and triangulability of surfaces are us...
AbstractWhitney [7] proved in 1932 that for any two embeddings of a planar 3-connected graph, their ...
AbstractWe survey some recent results on graphs embedded in higher surfaces or general topological s...
A planarizing set of a graph is a set of edges or vertices whose removal leaves a planar graph. It i...
AbstractIt is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere h...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
AbstractWe show that every 3-connected planar graph has a circular embedding in some nonspherical su...
A planar graph is a graph that can be drawn in such a way in the plane, so that no edges cross each ...
AbstractWe investigate the question of which graphs have planar emulators (a locally-surjective homo...
A planarizing set of a graph is a set of edges or vertices whose removal leaves a planar graph. It i...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
A graph Γ in a 3-manifold M is called planar if it is contained in an embedded 2-sphere in M. It is ...
Abstract. We investigate the question of which graphs have planar emulators (a locally-surjective ho...
AbstractWe show that every 3-connected planar graph has a circular embedding in some nonspherical su...
AbstractThe basic topological facts about closed curves in R2 and triangulability of surfaces are us...
AbstractWhitney [7] proved in 1932 that for any two embeddings of a planar 3-connected graph, their ...
AbstractWe survey some recent results on graphs embedded in higher surfaces or general topological s...
A planarizing set of a graph is a set of edges or vertices whose removal leaves a planar graph. It i...