Generating the Cycle Space of Planar Graphs
Matthias Hamann · The Electronic Journal of Combinatorics · 2015
We prove that the cycle space of every planar finitely separable 3-connected graph $G$ is generated by some $\operatorname{Aut}(G)$-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.