Partition into cliques for cubic graphs: Planar case, complexity and approximation