AbstractIn this paper we study graph embeddings in pseudosurfaces formed by three spheres sharing at most two points each pair, and in such a way that all vertices in the graph are in the same face. Our results and examples show that the behaviour of outer embeddings in these pseudosurfaces is rather different from embeddings on the pseudosurfaces considered in the literature so far
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
We provide a simple characterization of simplicial complexes on few vertices that embed into the d-s...
AbstractWe show that, in general, graph embeddability in pseudosurfaces cannot be characterized by m...
In this expository paper we revise some extensions of Kuratowski planarity criterion, providing a li...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
summary:In this Note, we study infinite graphs with locally finite outerplane embeddings, given a ch...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
A planar graph is a graph that can be drawn in such a way in the plane, so that no edges cross each ...
summary:In this Note, we study infinite graphs with locally finite outerplane embeddings, given a ch...
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed v...
Given a finite connected graph G and specifications for a closed, con-nected pseudosurface, we chara...
In this Note, we study infinite graphs with locally finite outerplane embeddings, given a character...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
AbstractA graph embedded on a surface is n-representative if every nontrivial closed curve in the su...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
We provide a simple characterization of simplicial complexes on few vertices that embed into the d-s...
AbstractWe show that, in general, graph embeddability in pseudosurfaces cannot be characterized by m...
In this expository paper we revise some extensions of Kuratowski planarity criterion, providing a li...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
summary:In this Note, we study infinite graphs with locally finite outerplane embeddings, given a ch...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
A planar graph is a graph that can be drawn in such a way in the plane, so that no edges cross each ...
summary:In this Note, we study infinite graphs with locally finite outerplane embeddings, given a ch...
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed v...
Given a finite connected graph G and specifications for a closed, con-nected pseudosurface, we chara...
In this Note, we study infinite graphs with locally finite outerplane embeddings, given a character...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
AbstractA graph embedded on a surface is n-representative if every nontrivial closed curve in the su...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
We provide a simple characterization of simplicial complexes on few vertices that embed into the d-s...