1 paper
Mingyang Gong, Brett Edgar, Jing Fan +2
Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seemingly escapes from the literature. A path containing at…