  The aim of this paper is to derive on the basis of the Euler's formula
several analytical relations which hold for certain classes of planar graphs
and which can be useful in algorithmic graph theory.
