We prove that the cycle space of every planar finitely separable 3-connected graph $G$ is generated by some ${\rm Aut}(G)$-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.
Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
On choosability with separation of planar graphs with lists of different sizes
Accessibility in transitive graphs
![QR code for arXiv:1411.6392 [math.CO]](http://oss.arxitics.com/images/favicon.svg)