On the Cycle Space of a 3--Connected Graph

Simple item page
dc.creatorKelmans, Alexander
dc.date2006-09-07
dc.date.accessioned2026-07-07T07:24:38Z
dc.date.available2026-07-07T07:24:38Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0609219
dc.identifierhttp://arxiv.org/abs/math/0609219
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116431
dc.subjectCombinatorics
dc.subject05C10
dc.titleOn the Cycle Space of a 3--Connected Graph
dc.typetext

Files

Collections

arXiv