22 citations · 31 across the 7 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
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…
math.CO2023
Bounds for the Competition-Independence game on trees
Jan Petr, Julien Portier
In this paper we prove that Sweller has a strategy so that the Sweller-Start Competition-Independence game lasts at least moves for every tree. Moreover, we show that t…