Gutin, Gregory, Bang-Jensen, J. and Huang, J. (1995) Weakly Hamiltonian-connected ordinary multipartite tournaments.. Discrete Mathematics, 138 (1-3).
Full text access: Open
We characterize weakly Hamiltonian-connected ordinary multipartite tournaments. Our result generalizes such a characterization for tournaments by Thomassen and implies a polynomial algorithm to decide the existence of a Hamiltonian path connecting two given vertices in an ordinary multipartite tournament and finds one, if it exists.
This is a Submitted version This version's date is: 1995 This item is not peer reviewed
https://repository.royalholloway.ac.uk/items/4b40cbb7-7f39-e9e2-3483-41bb3c6ab869/3/
Deposited by Research Information System (atira) on 25-Jul-2012 in Royal Holloway Research Online.Last modified on 25-Jul-2012