AbstractIn this paper we show how to compute the Euler characteristic of a graph if we know the neighborhood of any vertex of the graph. We build the graphs of the sphere and the torus, and use the obtained formula for the Euler characteristic for the evaluation of the number of vertices. We apply the obtained construction to compute the number of differing elements in tilings of the sphere and the torus
We introduce and study the notions of conical and spherical graphs. We show that these mutually excl...
AbstractWe introduce and study the notions of conical and spherical graphs. We show that these mutua...
We introduce and study the notions of conical and spherical graphs. We show that these mutually excl...
AbstractIn this paper we show how to compute the Euler characteristic of a graph if we know the neig...
AbstractContractible transformations of graphs consist of contractible gluing and deleting of vertic...
Euler characteristic is a topological invariant, a number that describes the shape or structure of a...
Euler characteristic is a topological invariant, a number that describes the shape or structure of a...
AbstractLet En be n-dimensional Euclidean space. A molecular space is a family of unit cubes in En. ...
AbstractContractible transformations of graphs consist of contractible gluing and deleting of vertic...
For well-composed (manifold) objects in the 3D cubical grid, the Euler characteristic is equal to ha...
AbstractA molecular space is a family of closed unit cubes in Euclidean space En. Cube vertices have...
AbstractAn Euler characteristic argument indicates that if K, a girth three graph, triangulates the ...
We introduce and study the notions of conical and spherical graphs. We show that these mutually excl...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
We introduce and study the notions of conical and spherical graphs. We show that these mutually excl...
We introduce and study the notions of conical and spherical graphs. We show that these mutually excl...
AbstractWe introduce and study the notions of conical and spherical graphs. We show that these mutua...
We introduce and study the notions of conical and spherical graphs. We show that these mutually excl...
AbstractIn this paper we show how to compute the Euler characteristic of a graph if we know the neig...
AbstractContractible transformations of graphs consist of contractible gluing and deleting of vertic...
Euler characteristic is a topological invariant, a number that describes the shape or structure of a...
Euler characteristic is a topological invariant, a number that describes the shape or structure of a...
AbstractLet En be n-dimensional Euclidean space. A molecular space is a family of unit cubes in En. ...
AbstractContractible transformations of graphs consist of contractible gluing and deleting of vertic...
For well-composed (manifold) objects in the 3D cubical grid, the Euler characteristic is equal to ha...
AbstractA molecular space is a family of closed unit cubes in Euclidean space En. Cube vertices have...
AbstractAn Euler characteristic argument indicates that if K, a girth three graph, triangulates the ...
We introduce and study the notions of conical and spherical graphs. We show that these mutually excl...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
We introduce and study the notions of conical and spherical graphs. We show that these mutually excl...
We introduce and study the notions of conical and spherical graphs. We show that these mutually excl...
AbstractWe introduce and study the notions of conical and spherical graphs. We show that these mutua...
We introduce and study the notions of conical and spherical graphs. We show that these mutually excl...
DOI
Add to ORKG