A Sharp Bound for the Circumference in $t$-tough graphs with $t>1$

Zh. G. Nikoghosyan

Published 2012-04-29Version 1

It is proved that if $G$ is a $t$-tough graph of order $n$ and minimum degree $\delta$ with $t>1$ then either $G$ has a cycle of length at least $\min\{n,2\delta+5\}$ or $G$ is the Petersen graph.