0 KB280 KB47 KB200820252011Kündgen, AndréRichter, R. Bruceštevilka:1letnik:4str. 79-93COBISSID:16263257ISSN:1855-3966URN:URN:NBN:SI:doc-9SLQ582UenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporanea2-factor2-faktorcubic graphdolg cikelgraph theoryinfinite graphkubični grafilong cycleneskončen grafsnarkteorija grafovOn 2-factors with long cycles in cubic graphs|Every 2-connected cubic graph ?$G$? has a 2-factor, and much effort has gone into studying conditions that guarantee ?$G$? to be Hamiltonian. We show that if ?$G$? is not Hamiltonian, then ?$G$? is either the Petersen graph or contains a 2-factor with a cycle of length at least 7. We also give infinite families of, respectively, 2- and 3-connected cubic graphs in which every 2-factor consists of cycles of length at most, respectively, 10 and 16TEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije