5-cycles and the Petersen graph
DeVos, Matt · Mkrtchyan, Vahan V. · Petrosyan, Samvel S.
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.