共 50 条
A local characterization for perfect plane near-triangulations
被引:1
|作者:
Salam, Sameera M.
[1
]
Babu, Jasine
[2
]
Krishnan, K. Murali
[1
]
机构:
[1] Natl Inst Technol Calicut, Dept Comp Sci & Engn, Calicut 673601, Kerala, India
[2] Indian Inst Technol, Dept Comp Sci & Engn, Palakkad 678557, Kerala, India
关键词:
Plane near-triangulated graphs;
Plane triangulated graphs;
Perfect graphs;
D O I:
10.1016/j.tcs.2020.06.031
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
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. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码:45 / 58
页数:14
相关论文