Graphs with no $2δ+ 1$ cycle
| dc.creator | Turner III, Galen E. | |
| dc.date | 2003-07-09 | |
| dc.date.accessioned | 2026-07-07T04:59:32Z | |
| dc.date.available | 2026-07-07T04:59:32Z | |
| dc.description | Dirac 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.description | 4 pages | |
| dc.identifier | https://arxiv.org/abs/math/0307123 | |
| dc.identifier | http://arxiv.org/abs/math/0307123 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/68023 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C35; 05C38; 05C75 | |
| dc.title | Graphs with no $2δ+ 1$ cycle | |
| dc.type | text |