5-cycles and the Petersen graph

Simple item page
dc.creatorDeVos, Matt
dc.creatorMkrtchyan, Vahan V.
dc.creatorPetrosyan, Samvel S.
dc.date2008-01-24
dc.date.accessioned2026-07-07T08:56:10Z
dc.date.available2026-07-07T08:56:10Z
dc.descriptionWe 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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/0801.3714
dc.identifierhttp://arxiv.org/abs/0801.3714
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146515
dc.subjectDiscrete Mathematics
dc.title5-cycles and the Petersen graph
dc.typetext

Files

Collections

arXiv