On the perfect $k$-divisibility of graphs

David Scholz

A graph $G$ is perfectly divisible if, for every induced subgraph $H$ of $G$, either $V(H)$ is a stable set or admits a partition into two sets $X_1$ and $X_2$ such that $ω(H[X_1])…