1. On the completeness of a generalized matching problem;Kirkpatrick,1978
2. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
3. The vertex-disjoint triangles problem;Guruswami,1998
4. Maximum bounded 3-dimensional matching is MAX snp-complete;Kann;Inf. Process. Lett.,1991
5. Partition into triangles on bounded degree graphs;van Rooij;Theory Comput. Syst.,2013