Abstract :
We show that for any positive integer c the problem whether the edge-set of a graph can be partitioned into subsets inducing graphs isomorphic to either a c-edge star or a c-edge matching is polynomial. This result suggests existence of theorems well-characterizing graphs admitting such partitions.
