Adjective
laceable (not comparable) (graph theory) Of a bipartite graph: having a possible Hamiltonian path between any two vertices from different partite sets.