Hamiltonicity of the cross product of two Hamiltonian graphs
โ Scribed by Sylvain Gravier
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 211 KB
- Volume
- 170
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract We prove that the strong product of any __n__ connected graphs of maximum degree at most __n__ contains a Hamilton cycle. In particular, __G__^ฮ(__G__)^ is hamiltonian for each connected graph __G__, which answers in affirmative a conjecture of Bermond, Germa, and Heydemann. ยฉ 2005 Wile
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