Text this: NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph