𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycle double covers of graphs with Hamilton paths

✍ Scribed by Luis A Goddyn

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
114 KB
Volume
46
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Double coverings of 2-paths by Hamilton
Double coverings of 2-paths by Hamilton cycles*
✍ Midori Kobayashi; Nobuaki Mutoh; Kiyasu-Zen'iti; Gisaku Nakamura πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## Abstract A double Dudeney set in __K~n~__ is a multiset of Hamilton cycles in __K~n~__ having the property that each 2‐path in __K~n~__ lies in exactly two of the cycles. A double Dudeney set in __K~n~__ has been constructed when __n__ β‰₯ 4 is even. In this paper, we construct a double Dudeney se

On cycle double covers of line graphs
On cycle double covers of line graphs
✍ Leizhen Cai; Derek Corneil πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 257 KB

It is shown that if a graph has a cycle double cover, then its line graph also has a cycle double cover. The converse of this result for 2-edge-connected graphs would imply the truth of the cycle double cover conjecture. Cycle Double Cover Conjecture (CDCC). Every 2-edge-connected graph has a CDC.

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

Perfect path double covers of graphs
Perfect path double covers of graphs
✍ J. A. Bondy πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 513 KB

## Abstract A __perfect path double cover__ (PPDC) of a graph __G__ on __n__ vertices is a family 𝒫 of __n__ paths of __G__ such that each edge of __G__ belongs to exactly two members of 𝒫 and each vertex of __G__ occurs exactly twice as an end of a path of 𝒫. We propose and study the conjecture th