On the Cycle Space of a 3--Connected Graph

Alexander K. Kelmans · arXiv (Cornell University) · 2006

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.

Read the paper · More papers on PaperTik