The complexity of partitioning into disjoint cliques and a triangle-free graph

Marin Bougeret, Pascal Ochem. The complexity of partitioning into disjoint cliques and a triangle-free graph. Discrete Applied Mathematics, 217:438-445, 2017. [doi]

Abstract

Abstract is missing.