We show that the number of independent sets in every outerplanar graph is greater than the number of its 4-dominating sets.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。