Long cycles in graphs with large degree sums and neighborhood unions
Heuvel van den, J. (1996) Long cycles in graphs with large degree sums and neighborhood unions. Journal of Graph Theory, 21 (1). pp. 87-102. ISSN 0364-9024
| PDF 780Kb |
| 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. |
| Item Type: | Article |
| Copyright: | © 1996 Wiley InterScience |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/71263 |
| Official URL: | http://dx.doi.org/10.1002/(SICI)1097-0118(199601)21:1<87::AID-JGT12>3.0.CO;2-P |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Repository Staff Only: item control page

Show download statistics for this publication
Show download statistics for this publication