A new proof of a theorem on long cycles

Rok, strany: 2015, 719 - 721

A new proof of the following well-known theorem due to Fan is given: Let $G$ be a $2$-connected graph of order $n$, and $3≤ c≤ n$. If $\max\{d(u),d(v)\}\ab≥ c/2$ for any two vertices $u$, $v$ at distance $2$, then $G$ contains a cycle of length at least $c$.

ISO 690:

Zhao, K. 2015. A new proof of a theorem on long cycles. In Mathematica Slovaca, vol. 65, no.3, pp. 719-721. 0139-9918. DOI: https://doi.org/10.1515/ms-2015-0049

APA:

Zhao, K. (2015). A new proof of a theorem on long cycles. Mathematica Slovaca, 65(3), 719-721. 0139-9918. DOI: https://doi.org/10.1515/ms-2015-0049