4 citations · 4 across the 3 of their papers we have counts for
1 paper · 1 filter
Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller
This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. T…