The Vertex-Disjoint Triangles Problem

The vertex-disjoint triangles (VDT) problem asks for a set of maximum number of pairwise vertex-disjoint triangles in a given graph G. The triangle cover problem asks for the existence of a perfect triangle packing in a graph G. It is known that the triangle cover problem is NP-complete on general graphs with clique number 3 [6]. The VDT problem is MAX SNP-hard on graphs with maximum degree four, while it can be approximated within 3/2+e, for any e > 0, in polynomial time [11].

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[3]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[4]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[5]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[6]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Harry B. Hunt,et al.  A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1994, ESA.

[9]  Jan van Leeuwen,et al.  Algorithms — ESA '94 , 1994, Lecture Notes in Computer Science.

[10]  Marek Karpinski,et al.  Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs , 1998, Discret. Appl. Math..

[11]  David G. Kirkpatrick,et al.  On Generalized Matching Problems , 1981, Inf. Process. Lett..

[12]  Alexander Schrijver,et al.  On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..

[13]  David G. Kirkpatrick,et al.  On the Complexity of General Graph Factor Problems , 1981, SIAM J. Comput..

[14]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).