Counting Minimal Transversals of β-Acyclic Hypergraphs

International audienceWe prove that one can count in polynomial time the number of minimal transversalsof β-acyclic hypergraphs. In consequence, we can count in polynomial timethe number of minimal dominating sets of strongly chordal graphs, continuingthe line of research initiated in [M.M. Kanté and T. Uno, Counting MinimalDominating Sets, TAMC'17]