Edge-disjoint packings of graphs

Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi
1994 Discrete Applied Mathematics  
In this paper we study two types of edge-disjoint packings of graphs. The induced edgedisjoint G packing problem is: given graph H and integer k, does H contain at least k copies of G as induced subgraphs such that no two such copies of G share an edge. We show that if G has at most two edges then the induced edge-disjoint G packing problem belongs to P, whereas for all other graphs G the problem is NP-complete. The second edge-disjoint packing problem concerns partial subgraphs and asks
more » ... a given graph H contains at least k copies G as partial subgraphs such that no two such copies of G share an edge. We show that if G has any connected component with at least three edges then this problem is NP-complete. 0166-218X/94/$07.00 0 199kElsevier Science B.V. All rights reserved SSDI 0166-218X(92)00153-6
doi:10.1016/0166-218x(92)00153-d fatcat:xjlp5zevqfb5dkq4d62it7f6ja