Graphs of spheres and tori
The author describes how the Euler characteristic of a graph can be computed from data for the neighborhoods of its vertices. This method is illustrated for certain graphs of the sphere and the torus. The formula for the Euler characteristic of such graphs is also used to obtain information about the number of elements (vertices, edges, tiles) in a tiling of the sphere or the torus.
scientific article; zbMATH DE number 562595