5-cycles and the Petersen graph

Matt DeVos, Vahan V. Mkrtchyan, Samvel S. Petrosyan

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.