Graphs of spheres and tori
type: Item
instance of: scholarly article
title: Graphs of spheres and tori
zbMATH Open document ID: 0797.05041
DOI: 10.1016/0012-365X(94)90116-3
author: Alexander V. Ivashchenko
published in: Discrete Mathematics
publication date: 1994-05-05T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05B45
zbMATH DE Number: 562595
zbMATH Keywords: Euler characteristic
zbMATH Keywords: sphere
zbMATH Keywords: torus
zbMATH Keywords: tiles
zbMATH Keywords: tiling
reviewed by: Egon Schulte
MaRDI profile type: Publication
cites work: Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane
cites work: Q5344631
cites work: Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs
cites work: Minimal graphs of a torus, a projective plane and spheres and some properties of minimal graphs of homotopy classes
cites work: Q3766517
description: scientific article; zbMATH DE number 562595