Paper detail

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

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, C_l$ such that each set $S_i$ is an independent set and each set $C_j$ induces a clique in $G$. The $(k,l)$-colouring problem, which is NP-complete in general, has been studied for special graph classes such as chordal graphs, cographs and line graphs. Let $\hatκ(G) = (κ_0(G),κ_1(G),\dots,κ_{θ(G)-1}(G))$ and $\hatλ(G) = (λ_0(G),λ_1(G),\dots,λ_{χ(G)-1}(G))$ where $κ_l(G)$ (respectively, $λ_k(G)$) is the minimum $k$ (respectively, $l$) such that $G$ has a $(k,l)$-colouring. We prove that $\hatκ(G)$ and $\hatλ(G)$ are a pair of conjugate sequences for every graph $G$ and when $G$ is a cograph, the number of vertices in $G$ is equal to the sum of the entries in $\hatκ(G)$ or in $\hatλ(G)$. Using the decomposition property of cographs we show that every cograph can be represented by Ferrers diagram. We devise algorithms which compute $\hatκ(G)$ for cographs $G$ and find an induced subgraph in $G$ that can be used to certify the non-$(k,l)$-colourability of $G$.