On the complexity of list $\mathcal{H}$-packing for sparse graph classes

Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi +5

The problem of packing as many subgraphs isomorphic to $H\in \mathcal{H}$ as possible in a graph for a class $\mathcal{H}$ of graphs is well studied in the literature. Both vertex-d…