(k; l)-Colourings and Ferrers Diagram Representations of Cographs

Dennis A. Epple, Jing Huang

For a pair of natural numbers $k,l$, a $(k,l)$-colouring of a graph $G$ is a partition of the vertex set of $G$ into (possibly empty) sets $S_1,S_2,\dots ,S_k$, $C_1, C_2, \dots…