We give a necessary condition of generic 3 -rigidity of graphs relying on partitioning the edges into 3 subsets; such that each subset-pair gives a generically 2-rigid graph, either by themselves or after an appropriate edge-deletion. Notably, as pointed out by Dewar and Gallet, the condition is still not sufficient.