2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/146515We 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 pagesDiscrete Mathematicstext