Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets

Marthe Bonamy, Oscar Defrain, Piotr Micek +1

Enumerating minimal transversals in a hypergraph is a notoriously hard problem. It can be reduced to enumerating minimal dominating sets in a graph, in fact even to enumerating min…