This is a slightly different question than the one asked here.
I understand that for non-planar graph there are edges in the graph which has more than 2 cycles sharing on it. But for planar graph, can we prove that it is always possible to find a complete set of cycle basis that each edge is shared by at most 2 cycles?