Finding k Disjoint Triangles in an Arbitrary Graph

14 years 5 months ago

We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a ﬁxed graph H. For H = K3

Mike Fellows, Pinar Heggernes, Frances A. Rosamond

Computer Science | Input Graph | NP-complete Problem | WG 2004 |

claim paper

Added	03 Jul 2010
Updated	03 Jul 2010
Type	Conference
Year	2004
Where	WG
Authors	Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle

Comments (0)