5-cycles and the Petersen graph

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We show that if G is a connected bridgeless cubic graph whose every 2-factor is comprised of cycles of length five then G is the Petersen graph.
6 pages

Keywords

Discrete Mathematics

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0801.3714
 http://arxiv.org/abs/0801.3714

Collections

arXiv