In this paper we study the class of graphs without cycles of size 4 and independent sets of size 4 as induced subgraphs: $\mathop{Free}\{C_4, 4K_1\}$. This is one of the three minimal minimal open cases for the complexity of the colouring problem when restricted to classes defined by excluding induced subgraphs of order 4. We investigate the clique width of some subclasses of $\mathop{Free}\{C_4, 4K_1\}$. We introduce a new framework: the $(k,l,m)$-decomposition and prove that if all the graphs of a class $\cal G$ are $(k,l,m)$-decomposable, then graphs in $\cal G$ have bounded clique width. We give a few examples of such class, found with the help of a program we designed. We also show, for any graph $G \in \mathop{Free}\{C_4, 4K_1\}$ that is 3 cliques coverable, an infinite family in $\mathop{Free}\{C_4, 4K_1\}$ of supergraphs of $G$ which have unbounded clique width.