The Pairing-Hamiltonian property in Cartesian products of graphs

Federico Romaniello

Let $G$ be a simple graph of even order at least four, and let $K_G$ denote the complete graph on $V(G)$. A perfect matching of $K_G$ is called a pairing of $G$. The graph $G$ has…