The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs
Valentin Bouquet, Christophe Picouleau
·
2020-01-21
·
via math.CO updates on arXiv.org
We prove that the Minimum Dominating Set problem is polynomial for the class of (claw, P8)-free graphs.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。