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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.