27 citations · 100 across the 31 of their papers we have counts for
1 paper · 2 filters
Blair D. Sullivan, Andrew van der Poel
The k-CO-PATH SET problem asks, given a graph G and a positive integer k, whether one can delete k edges from G so that the remainder is a collection of disjoint paths. We give a l…