P502: Enumerate all minimal dominating sets in a triangle-free graph.

P502: Enumerate all minimal dominating sets in a triangle-free graph.

Input:

A triangle-free graph $G$ with $n$ vertices.

Output:

All minimal dominating sets in $G$.

Complexity:

$O(poly(n)\cdot |\mathcal{D}(G)|^2)$ total time with $O(poly(n))$ space.

Comment:

$\mathcal{D}(G)$ is the set of solutions.

Reference:

[Bonamy2019] (Bibtex)