Let $G$ be a planar graph with a planar embedding with $f$ faces. The degree of a face $f_i$ is the number $a_i$ of edges that are incident to $f_i$ (counting bridges twice). Assume that the faces $f_1$, . . . , $f_f$ are ordered such that their degrees are non descending. Consider the degreesequence ($a_1$, . . . , $a_f$ ) of the faces.