On the Cycle Space of a 3--Connected Graph
classification
🧮 math.CO
keywords
cyclegraphspacecircuitconnectednon-separatingcircuitsgenerated
read the original abstract
We give a simple proof of Tutte's theorem stating that the cycle space of a 3--connected graph is generated by the set of non-separating circuits of the graph. Keywords: graph, cycle, circuit, cycle space, non-separating circuit, strong isomorphism.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.