On the Cycle Space of a 3--Connected Graph
Combinatorics
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.math/0609219,
title = {On the Cycle Space of a 3--Connected Graph},
author = {Alexander Kelmans},
journal= {arXiv preprint arXiv:math/0609219},
year = {2007}
}