  We derive a local criterion for a plane near-triangulated graph to be
perfect. It is shown that a plane near-triangulated graph is perfect if and
only if it does not contain either a vertex, an edge or a triangle, the
neighbourhood of which has an odd hole as its boundary. The characterization
leads to an $O(n^2)$ algorithm for checking perfectness of plane
near-triangulations.
