A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons, if it has a u - v Hamiltonian path for all pairs of vertices u and v, where u belongs to one set of the bipartition, and v to the other. A bipartite graph whose detour matrix elements (Δ)_(i, j) are maximal for all i and j corresponding to different elements of the vertex bipartition is therefore Hamilton-laceable.

detour matrix | Hamilton-connected graph | Hamiltonian graph | H^*-connected graph