Generating the cycle space of planar graphs

Abstract

We prove that the cycle space of every planar finitely separable 3-connected graph G is generated by some Aut(G)-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.