The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs
Abstract
We prove that the Minimum Dominating Set problem is polynomial for the class of (claw, P8)-free graphs.
Origin : Files produced by the author(s)