A -vertex Kernel for -packing
arXiv:1804.02801 · doi:10.1016/j.tcs.2022.01.032
Abstract
The -packing problem asks for whether a graph contains vertex-disjoint paths each of length two. We continue the study of its kernelization algorithms, and develop a -vertex kernel.