I am aware that deciding the existence of decomposition of a cubic graph into edge-disjoint claws is polynomial time solvable.
What is the complexity of deciding the existence of decomposition of a cubic graph into vertex-disjoint claws? Is it NP-complete?
In the former problem, we partition the edge set into edge-disjoint claws while in the later one we partition the vertex set into vertex-disjoint claws.
This was posted on CS StackExchange without answers.