Indexed metadata
Generating the Cycle Space of Planar Graphs
Matthias Hamann
Source abstract
We prove that the cycle space of every planar finitely separable 3-connected graph is generated by some -invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.