A local characterization for perfect plane near-triangulations
Discrete Mathematics
2020-07-08 v3 Combinatorics
Abstract
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 algorithm for checking perfectness of plane near-triangulations.
Cite
@article{arxiv.1906.06200,
title = {A local characterization for perfect plane near-triangulations},
author = {Sameera M. Salam and Jasine Babu and K. Murali Krishnan},
journal= {arXiv preprint arXiv:1906.06200},
year = {2020}
}