A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Generating the cycle space of planar graphs
unpublished
Preserved Fulltext
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.
fatcat:cbucumib2vfmzpswa2iv6zl2k4