Abstract
We present and prove several results concerning the length of longest cycles in 2-connected or 1-tough graphs with large degree sums. These results improve many known results on long cycles in these graphs. We also consider the sharpness of the results and discuss some possible strengthenings.
| Original language | English |
|---|---|
| Pages (from-to) | 87-102 |
| Journal | Journal of graph theory |
| Volume | 21 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1996 |