We introduce a class of plane graphs called weak near-triangulations, and prove that this class is closed under certain graph operations. Then we use the properties of weak near-triangulations to prove that every plane triangulation on $n>6$ vertices has a dominating set of size at most $17n/53$. This improves the bound $n/3$ obtained by Matheson and Tarjan.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。