AbstractWe have collected several open problems on graphs which arise in geometric topology, in particular in the following areas: 1.(1) basic embeddability of compacta into the plane R2;2.(2) approximability of maps by embeddings;3.(3) uncountable collections of continua in R2 and their span; and4.(4) representations of closed PL manifolds by colored graphs. These problems should be of interest to both topologists and combinatorists
AbstractThere exists a path-connected subspace of the plane for which graph embeddability is undecid...
AbstractA conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorien...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
We have collected several open problems on graphs which arise in geometric topology, in particular i...
We have collected several open problems on graphs which arise in geometric topology, in particular i...
AbstractWe survey some recent results on graphs embedded in higher surfaces or general topological s...
AbstractThe notion of a basic embedding appeared in research motivated by Kolmogorov–Arnold's soluti...
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...
Flötotto A. Embeddability of graphs into the Klein surface. Bielefeld (Germany): Bielefeld Universit...
AbstractThere exist very efficient algorithms to decide whether a graph is planar. How difficult can...
AbstractThe main theorem (2.1) says that if N is an abstract regular neighborhood of a polyhedron X ...
AbstractThere exist very efficient algorithms to decide whether a graph is planar. How difficult can...
We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003)...
AbstractWhitney [7] proved in 1932 that for any two embeddings of a planar 3-connected graph, their ...
AbstractThere exists a path-connected subspace of the plane for which graph embeddability is undecid...
AbstractA conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorien...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
We have collected several open problems on graphs which arise in geometric topology, in particular i...
We have collected several open problems on graphs which arise in geometric topology, in particular i...
AbstractWe survey some recent results on graphs embedded in higher surfaces or general topological s...
AbstractThe notion of a basic embedding appeared in research motivated by Kolmogorov–Arnold's soluti...
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...
Flötotto A. Embeddability of graphs into the Klein surface. Bielefeld (Germany): Bielefeld Universit...
AbstractThere exist very efficient algorithms to decide whether a graph is planar. How difficult can...
AbstractThe main theorem (2.1) says that if N is an abstract regular neighborhood of a polyhedron X ...
AbstractThere exist very efficient algorithms to decide whether a graph is planar. How difficult can...
We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003)...
AbstractWhitney [7] proved in 1932 that for any two embeddings of a planar 3-connected graph, their ...
AbstractThere exists a path-connected subspace of the plane for which graph embeddability is undecid...
AbstractA conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorien...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...