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]

Authors

Marin Bougeret

This author has not been identified. Look up 'Marin Bougeret' in Google

Pascal Ochem

This author has not been identified. Look up 'Pascal Ochem' in Google