Hamilton and long cycles in t-tough graphs with t>1

arXiv1202.6556MaRDI QIDQ6231341FDOQ6231341

Authors: Zh. G. Nikoghosyan 

Publication date: 29 February 2012

Abstract: 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 $minn,2delta+4$ or $G$ is the Petersen graph.

This page was built for publication: Hamilton and long cycles in $t$-tough graphs with $t>1$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6231341)