Hamilton and long cycles in $t$-tough graphs with $t>1$
Combinatorics
2012-03-19 v1
Abstract
It is proved that if is a -tough graph of order and minimum degree with then either has a cycle of length at least or is the Petersen graph.
Cite
@article{arxiv.1202.6556,
title = {Hamilton and long cycles in $t$-tough graphs with $t>1$},
author = {Zh. G. Nikoghosyan},
journal= {arXiv preprint arXiv:1202.6556},
year = {2012}
}
Comments
19 pages. arXiv admin note: text overlap with arXiv:1201.1551 and arXiv:1201.6330