Hamiltonian decompositions of products of cycles (Q5905596): Difference between revisions

The tensor product of two graphs \(G_ 1=(V_ 1,E_ 1)\) and \(G_ 2= (V_ 2, E_ 2)\) has vertex set \(V_ 1 \times V_ 2\), and \((u_ 1,u_ 2)\) adjacent to \((v_ 1,v_ 2)\) if and only if \(u_ 1v_ 1 \in E_ 1\) and \(u_ 2v_ 2 \in E_ 2\). The author proves that if the tensor product of \(m\) cycles, of arbitrary lengths, is connected, then it has a Hamilton decomposition. If such a product is not connected, then all components are pairwise isomorphic and have Hamilton decompositions.