The P2-packing problem asks for whether a graph contains k vertex-disjoint paths each of length two. We continue the study of its kernelization algorithms, and develop a 5k-vertex kernel.
@article{arxiv.1804.02801,
title = {A $5k$-vertex Kernel for $P_2$-packing},
author = {Wenjun Li and Junjie Ye and Yixin Cao},
journal= {arXiv preprint arXiv:1804.02801},
year = {2022}
}