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