AbstractWe survey some recent results on graphs embedded in higher surfaces or general topological spaces
The study of topological embeddings of graphs, that is to say the ways of drawing without crossing a...
The study of topological embeddings of graphs, that is to say the ways of drawing without crossing a...
This Ph.D. manuscript is built around the notion of graph embedding. An embedding of a graph G is an...
A prominent question of topological graph theory is what type of surface can a nonplanar graph be e...
A prominent question of topological graph theory is what type of surface can a nonplanar graph be e...
AbstractIt is shown that the genus of an embedding of a graph can be determined by the rank of a cer...
AbstractThe basic topological facts about closed curves in R2 and triangulability of surfaces are us...
Flötotto A. Embeddability of graphs into the Klein surface. Bielefeld (Germany): Bielefeld Universit...
AbstractThe complexity of embedding a graph into a variety of topological surfaces is investigated. ...
AbstractWe have collected several open problems on graphs which arise in geometric topology, in part...
AbstractThe complexity of embedding a graph into a variety of topological surfaces is investigated. ...
AbstractWe give a simple proof of the fact (which follows from the Robertson–Seymour theory) that a ...
AbstractIt is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere h...
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 embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
The study of topological embeddings of graphs, that is to say the ways of drawing without crossing a...
The study of topological embeddings of graphs, that is to say the ways of drawing without crossing a...
This Ph.D. manuscript is built around the notion of graph embedding. An embedding of a graph G is an...
A prominent question of topological graph theory is what type of surface can a nonplanar graph be e...
A prominent question of topological graph theory is what type of surface can a nonplanar graph be e...
AbstractIt is shown that the genus of an embedding of a graph can be determined by the rank of a cer...
AbstractThe basic topological facts about closed curves in R2 and triangulability of surfaces are us...
Flötotto A. Embeddability of graphs into the Klein surface. Bielefeld (Germany): Bielefeld Universit...
AbstractThe complexity of embedding a graph into a variety of topological surfaces is investigated. ...
AbstractWe have collected several open problems on graphs which arise in geometric topology, in part...
AbstractThe complexity of embedding a graph into a variety of topological surfaces is investigated. ...
AbstractWe give a simple proof of the fact (which follows from the Robertson–Seymour theory) that a ...
AbstractIt is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere h...
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 embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
The study of topological embeddings of graphs, that is to say the ways of drawing without crossing a...
The study of topological embeddings of graphs, that is to say the ways of drawing without crossing a...
This Ph.D. manuscript is built around the notion of graph embedding. An embedding of a graph G is an...