Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments

We characterize those bipartite tournaments which have a hamiltonian path with given unordered endvertices. Our proof gives rise to a polynomial algorithm to decide the existence of such a path and find one, if it exists.