1 paper · 1 filter
Jungho Ahn, Jinha Kim, O-joung Kwon
Let F be a family of graphs, and let p,r be nonnegative integers. The \textsc{(p,r,F)-Covering} problem asks whether for a graph G and an integer k, t…