Large sets of Hamilton cycle and path decompositions
β Scribed by Hongtao Zhao; Qingde Kang
- Book ID
- 108113915
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 173 KB
- Volume
- 308
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A large set of __CS__(__v__, __k__, Ξ»), __k__βcycle system of order __v__ with index Ξ», is a partition of all __k__βcycles of __K__~__v__~ into __CS__(__v__, __k__, Ξ»)s, denoted by __LCS__(__v__, __k__, Ξ»). A (__v__βββ1)βcycle is called almost Hamilton. The completion of the existence s
Let G ΒΌ Γ°VΓ°GΓ; EΓ°GΓΓ be a graph. A Γ°v v v; G; Γ-GD is a partition of all the edges of LGD. In this paper, we obtain a general result by using the finite fields, that is, if q ! k ! 2 is an odd prime power, then there exists a Γ°q; P k ; k Γ 1Γ-LGD.
## Abstract We construct a new symmetric Hamilton cycle decomposition of the complete graph __K~n~__ for odd __n__β>β7. Β© 2003 Wiley Periodicals, Inc.