collaborators

1 paper

cs.CC2023

The complexity of decomposing a graph into a matching and a bounded linear forest

Agnijo Banerjee, João Pedro Marciano, Adva Mond +2

Deciding whether a graph can be edge-decomposed into a matching and a -bounded linear forest was recently shown by Campbell, H{ö}rsch and Moore to be NP-complete for every $k \g…