Weight of faces in plane maps
In his doctoral thesis (1994), O. V. Borodin described the structure of the neighbourhoods (in the combinatorial sense of weights) of edges and faces in several classes of planar graphs (with applications to problems of cyclic and simultaneous colorings). In particular, e.g. the edge neighbourhoods of 3-polytopes could be described in a detailed manner. In the present paper, the authors investigate the structure of face neighbourhoods of planar graphs. More precisely, they derive exact upper bounds for the minimum weight of minor faces in normal planar maps and for 3-polytopes with specified maximal vertex degree.
scientific article; zbMATH DE number 1407574