Hamilton cycles in strong products of graphs

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 Wiley Periodicals, Inc. J Graph Theory 48: 299–321, 2005