1 citations · 1 across the 12 of their papers we have counts for
1 paper · 1 filter
Agnijo Banerjee, João Pedro Marciano, Adva Mond +2
Deciding whether a graph can be edge-decomposed into a matching and a k-bounded linear forest was recently shown by Campbell, H{ö}rsch and Moore to be NP-complete for every $k \g…