Marin Bougeret, Pascal Ochem. The complexity of partitioning into disjoint cliques and a triangle-free graph. Discrete Applied Mathematics, 217:438-445, 2017. [doi]
@article{BougeretO17,
title = {The complexity of partitioning into disjoint cliques and a triangle-free graph},
author = {Marin Bougeret and Pascal Ochem},
year = {2017},
doi = {10.1016/j.dam.2016.10.004},
url = {http://dx.doi.org/10.1016/j.dam.2016.10.004},
researchr = {https://researchr.org/publication/BougeretO17},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {217},
pages = {438-445},
}