Dominated Minimal Separators are Tame (Nearly All Others are Feral)

Peter Gartland, Daniel Lokshtanov

A class $\mathcal{F}$ of graphs is called {\em tame} if there exists a constant $k$ so that every graph in $\mathcal{F}$ on $n$ vertices contains at most $O(n^k)$ minimal separators, {\e…