𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two edge-disjoint hamiltonian cycles in graphs

✍ Scribed by Mingchu Li

Publisher
Springer Japan
Year
1994
Tongue
English
Weight
548 KB
Volume
10
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge disjoint cycles in graphs
Edge disjoint cycles in graphs
✍ Li Hao πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 419 KB
Edge-disjoint Hamiltonian cycles in hype
Edge-disjoint Hamiltonian cycles in hypertournaments
✍ Vojislav Petrovic; Carsten Thomassen πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 58 KB

## Abstract We introduce a method for reducing __k__‐tournament problems, for __k__ β‰₯ 3, to ordinary tournaments, that is, 2‐tournaments. It is applied to show that a __k__‐tournament on __n__ β‰₯ k + 1 + 24__d__ vertices (when __k__ β‰₯ 4) or on __n__ β‰₯ 30__d__ + 2 vertices (when __k__ = 3) has __d__

Edge disjoint Hamilton cycles in graphs
Edge disjoint Hamilton cycles in graphs
✍ Guojun Li πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 125 KB πŸ‘ 2 views
Disjoint Hamiltonian cycles in recursive
Disjoint Hamiltonian cycles in recursive circulant graphs
✍ C. Micheneau πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 499 KB

We show in this paper that the circulant graph G( 2"', 4) is Hamiltonian decomposable, and propose a recursive construction method. This is a partial answer to a problem posed by B. Alspach. @

Edge-disjoint cycles in regular directed
Edge-disjoint cycles in regular directed graphs
✍ Alon, Noga; McDiarmid, Colin; Molloy, Michael πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 356 KB πŸ‘ 3 views

We prove that any k-regular directed graph with no parallel edges contains a collection of at least fl(k2) edge-disjoint cycles; we conjecture that in fact any such graph contains a collection of at least ( lCi1 ) disjoint cycles, and note that this holds for k 5 3. o 1996