NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph

الأصل · EN

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. This problem is known to be -complete on arbitrary graphs. We show that this problem remains -complete even when restricted to planar graphs and perfect graphs.