A bipartite graph with bipartition A and B is said to be Hamilton-laceable if for any u is an element of A and v is an element of B there is a Hamilton path joining u and v. It is known that the double generalized Petersen graph DP(n, k) is Hamiltonian and is bipartite if and only if n is even. In this paper we show that the bipartite double generalized Petersen graph DP(n, k) is Hamilton-laceable for n >= 4. (C) 2021 Elsevier B.V. All rights reserved.