A bipartite graph with bipartition A and B is said to be Hamilton-laceable if for any $u\in A$ and $v\in 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\ge 4$.

中文翻译：

---

关于双重广义彼得森图的汉密尔顿可解性

具有二分A和B 的二分图被称为是 Hamilton-laceable 如果有的话$你\in \mathrm{一种}$ 和 $v\in 乙$有一条汉密尔顿路径连接u和v。已知双重广义彼得森图$D磷(n,克)$是哈密顿量并且是二分的当且仅当n是偶数。在本文中，我们展示了二分双广义彼得森图$D磷(n,克)$ 是 Hamilton-laceable $n\ge 4$.