 Half graph

A half graph has two vertex classes $X=\{x_1,\dots ,x_n\}$ and $Y=\{y_1,\dots ,y_n\}$, with $x_i$ adjacent to $y_j$ exactly when $i\le j$. Its nested vertex neighbourhoods give a useful obstruction to partitions in which every pair is a regular pair of vertex sets.