Key points are not available for this paper at this time.
We show that for each fixed n 3 it is NP-complete to determine whether an arbitrary graph can be edge-partitioned into subgraphs isomorphic to the complete graph Kₙ. The NP-completeness of a number of other edge-partition problems follows immediately.
Ian Holyer (Sun,) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: