Article contents
Hamiltonian Cycles in Strong Products of Graphs
Published online by Cambridge University Press: 20 November 2018
Extract
Abstract. Let denote the graph (k times) where is the strong product of the two graphs G and H. In this paper we prove the conjecture of J. Zaks [3]: For every connected graph G with at least two vertices there exists an integer k = k(G) for which the graph is hamiltonian.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1979
References
- 6
- Cited by