5-cycles and the Petersen graph
Discrete Mathematics
2008-01-25 v1
Abstract
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.
Cite
@article{arxiv.0801.3714,
title = {5-cycles and the Petersen graph},
author = {Matt DeVos and Vahan V. Mkrtchyan and Samvel S. Petrosyan},
journal= {arXiv preprint arXiv:0801.3714},
year = {2008}
}
Comments
6 pages