1 citations · 1 across the 1 of their papers we have counts for
1 paper
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.