5-cycles and the Petersen graph
arXiv:0801.3714
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.
6 pages
arXiv:0801.3714
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