A graph G is Hamiltonian-connected if every two vertices of G are connected by a Hamilton path. A bipartite graph H is Hamiltonian-laceable if any two vertices from different partite sets of H are connected by a Hamilton ...