On the Cycle Space of a 3--Connected Graph

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Combinatorics, 05C10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/116431

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0609219
 http://arxiv.org/abs/math/0609219

Collections

arXiv