Let G = (V, E) be a connected graph with a weight function w : V → Z+ and let q ≥ 2 be a positive integer. For X ⊆ V , let w(X) denote the sum of the weights of the vertices in X . We consider the… (More)

For a fixed family F of graphs, an F -packing in a graph G is a set of pairwise vertexdisjoint subgraphs of G, each isomorphic to an element of F . Finding an F -packing that maximizes the number of… (More)

For a fixed family F of graphs, an F -packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F . Finding an F -packing that maximizes the number of… (More)