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

Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum

โœ Scribed by Michael Ferrara; Michael S. Jacobson; Angela Harris

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
190 KB
Volume
26
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Relative length of long paths and cycles
Relative length of long paths and cycles in graphs with large degree sums
โœ Hikoe Enomoto; Jan van den Heuvel; Atsushi Kaneko; Akira Saito ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 601 KB

## Abstract For a graph __G, p__(__G__) denotes the order of a longest path in __G__ and __c__(__G__) the order of a longest cycle. We show that if __G__ is a connected graph __n__ โ‰ฅ 3 vertices such that __d__(__u__) + __d__(__v__) + __d__(__w__) โ‰ง n for all triples __u, v, w__ of independent verti