Gregory Gutin, 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 Published version This version's date is: 1995 This item is peer reviewed
https://repository.royalholloway.ac.uk/items/4b40cbb7-7f39-e9e2-3483-41bb3c6ab869/1/
Deposited by () on 23-Dec-2009 in Royal Holloway Research Online.Last modified on 25-May-2010