On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$

Simple item page
dc.creatorNikoghosyan, Zh. G.
dc.date2009-05-09
dc.date.accessioned2026-07-07T13:13:31Z
dc.date.available2026-07-07T13:13:31Z
dc.descriptionTwo sharp lower bounds for the length of a longest cycle $C$ of a graph $G$ are presented in terms of the lengths of a longest path and a longest cycle of $G-C$, denoted by $\overline{p}$ and $\overline{c}$, respectively, combined with minimum degree $δ$: (1) $|C|\geq(\overline{p}+2)(δ-\overline{p})$ and (2) $|C|\geq(\overline{c}+1)(δ-\overline{c}+1)$.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/0905.1394
dc.identifierhttp://arxiv.org/abs/0905.1394
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229913
dc.subjectCombinatorics
dc.subject05C38
dc.titleOn Longest Cycle $C$ of a graph $G$ via Structures of $G-C$
dc.typetext

Files

Collections

arXiv