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

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

2012-02-29

arxiv.org/abs/1202.6556v1

Mathematics

Combinatorics

19 pages. arXiv admin note: text overlap with arXiv:1201.1551 and arXiv:1201.6330

Scientific paper

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+4\}$ or $G$ is the Petersen graph.

Affiliated with

Also associated with

No associations

Rating

Hamilton and long cycles in $t$-tough graphs with $t>1$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hamilton and long cycles in $t$-tough graphs with $t>1$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamilton and long cycles in $t$-tough graphs with $t>1$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524236