Partitioning of a graph into induced subgraphs not containing prescribed cliques

Yaser Rowshan, Ali Taherkhani

Let $K_p$ be a complete graph of order $p\ge 2$. A $K_p$-free $k$-coloring of a graph $H$ is a partition of $V(H)$ into $V_1,V_2\dots ,V_k$ such that $H[V_i]$ does not contain $K…