๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles

โœ Scribed by Dieter Rautenbach; Lutz Volkmann


Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
94 KB
Volume
52
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Long cycles in graphs with large degree
โœ Van den Heuvel, J. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 801 KB

We present and prove several results concerning the length of longest cycles in 2connected or I-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.