We characterize those bipartite tournaments which have a hamiltonian p
ath with given unordered endvertices. Our proof gives rise to a polyno
mial algorithm to decide the existence of such a path and find one, if
it exists. (C) 1995 Academic Press, Inc.