## Abstract We construct a new symmetric Hamilton cycle decomposition of the complete graph __K~n~__ for odd __n__โ>โ7. ยฉ 2003 Wiley Periodicals, Inc.
Directed Hamilton Cycle Decompositions of the Tensor Products of Symmetric Digraphs
โ Scribed by P. Paulraja; S. Sivasankar
- Book ID
- 106047805
- Publisher
- Springer Japan
- Year
- 2009
- Tongue
- English
- Weight
- 166 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we characterize graphs G for which GยฎK2 is Hamiltonian, where ยฎ denotes the tensor product of graphs. The relationship between the bieulerian orientation of a 4-regular graph G and the existence of a pair of edge-disjoint Hamilton cycles in GยฎK2 is established. Also a characterization
Let n โฅ 2 be an integer. The complete graph K n with a 1-factor F removed has a decomposition into Hamilton cycles if and only if n is even. We show that K n -F has a decomposition into Hamilton cycles which are symmetric with respect to the 1-factor F if and only if n โก 2,4 mod 8. We also show that