arXiv Analytics

Sign in

arXiv:math/0609219 [math.CO]AbstractReferencesReviewsResources

On the Cycle Space of a 3--Connected Graph

Alexander Kelmans

Published 2006-09-07Version 1

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.

Categories: math.CO
Subjects: 05C10
Related articles: Most relevant | Search more
arXiv:1201.6529 [math.CO] (Published 2012-01-31, updated 2012-09-23)
The phase transition in random graphs - a simple proof
arXiv:math/0409447 [math.CO] (Published 2004-09-23)
A simple proof of associativity and commutativity of LR-coefficients (or the hive ring)
arXiv:1410.5590 [math.CO] (Published 2014-10-21)
A new simple proof of the Aztec diamond theorem

Links

Toolbox