NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.