Certain NP-complete matching problems (Q794163)

A matching problem, which we call 3DMS, is considered and is shown to be NP-complete. From this result there follows directly the NP-completeness of the disjoint matchings decision problem. In addition, the NP- completeness of kDMS \((k>3)\) is established. From this there follow p(k)- 2 other NP-complete matching problems, where p(k) is the cardinality of the set of partitions of the integer k.