Graphs with no $2δ+ 1$ cycle

dc.creatorTurner III, Galen E.
dc.date2003-07-09
dc.date.accessioned2026-07-07T04:59:32Z
dc.date.available2026-07-07T04:59:32Z
dc.descriptionDirac proved that any graph with minimum vertex degree $δ$ contains either a cycle of length at least $2δ$ or a Hamilton cycle. Motivated by this result, we characterize those graphs having no cycle longer than $2δ$.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/math/0307123
dc.identifierhttp://arxiv.org/abs/math/0307123
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68023
dc.subjectCombinatorics
dc.subject05C35; 05C38; 05C75
dc.titleGraphs with no $2δ+ 1$ cycle
dc.typetext

Files

Collections