𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Hamilton circuits and Hamilton paths

✍ Scribed by G. A. Dirac

Publisher
Springer
Year
1972
Tongue
English
Weight
828 KB
Volume
197
Category
Article
ISSN
0025-5831

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hamilton cycle and Hamilton path extenda
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
✍ Ε tefko MiklaviČ; PrimoΕΎ Ε parl πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 198 KB

## Abstract In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Ξ“ is __n__‐__HC‐extendable__ if it contains a path of length __n__ and if every such path is contained in some Hamilton cycle of Ξ“. Similarly, Ξ“ is __weakly n__‐__HP‐

Hamilton cycles and paths in butterfly g
Hamilton cycles and paths in butterfly graphs
✍ Stephen A. Wong πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 536 KB

## Abstract A cycle __C__ in a graph __G__ is a __Hamilton cycle__ if __C__ contains every vertex of __G__. Similarly, a path __P__ in __G__ is a __Hamilton path__ if __P__ contains every vertex of __G__. We say that __G__ is __Hamilton__‐__connected__ if for any pair of vertices, __u__ and __v__ o