NP-hardness of a graph partition problem?
I've found that this problem is NP-hard, even restricted to trees.
The reference is Graham and Robinson, "Isomorphic factorizations IX: even trees", but I couldn't get it.