A local characterization for perfect plane near-triangulations

06/14/2019

∙

by   Sameera M. Salam, et al.

∙

0

∙

share

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 neighborhood of which has an odd hole as its boundary.