collaborators

1 paper

cs.DS2023

On the complexity of list -packing for sparse graph classes

Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi +5

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