Minimal dominating sets in graph classes: Combinatorial bounds and enumeration