Hamiltonian properties in generalized lexicographic products

Jan Ekstein, Jakub Teska

The lexicographic product $G[H]$ of two graphs $G$ and $H$ is obtained from $G$ by replacing each vertex with a copy of $H$ and adding all edges between any pair of copies correspo…