Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have