NoleenKöhler

We introduce the notion of delineation. A graph class $\mathcal{C}$ is said delineated by twin-width (or simply, delineated) if for every hereditary closure $\mathcal{D}$ of a subclass of $\mathcal{C}$, it holds that $\mathcal{D}$ has bounded twin-width if and only if $\mathcal{D}$ is monadically dependent. An effective strengthening of delineation for …