𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dirac type condition and Hamiltonian-connected graphs

✍ Scribed by Chen, Deqin; Li, Zu; Zhao*, Kewen

Book ID
126578947
Publisher
Taylor and Francis Group
Year
2011
Tongue
English
Weight
183 KB
Volume
34
Category
Article
ISSN
1607-3606

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On hamiltonian-connected graphs
On hamiltonian-connected graphs
✍ Ronald J. Gould; Xingxing Yu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 735 KB

## Abstract One of the most fundamental results concerning paths in graphs is due to Ore: In a graph __G__, if deg __x__ + deg __y__ ≧ |__V__(__G__)| + 1 for all pairs of nonadjacent vertices __x, y__ β‰… __V__(__G__), then __G__ is hamiltonian‐connected. We generalize this result using set degrees.