Parameterized Complexity of Star Decomposition Problem
Parameterized Complexity of Star Decomposition Problem
A star of length $ \ell $ is defined as the complete bipartite graph $ K_{1,\ell } $. In this paper we deal with the problem of edge decomposition of graphs into stars of varying lengths. Given a graph $ G $ and a list of integers $S=(s_1,\ldots, s_t) $, …