15 citations · 28 across the 8 of their papers we have counts for
1 paper · 2 filters
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…