Weakly Hamiltonian-connected ordinary multipartite tournaments.

Gregory Gutin, Bang-Jensen, J. and Huang, J.

(1995)

Gregory Gutin, Bang-Jensen, J. and Huang, J. (1995) Weakly Hamiltonian-connected ordinary multipartite tournaments.. Discrete Mathematics, 138 (1-3).

Our Full Text Deposits

Full text access: Open

Full Text - 164.95 KB

Links to Copies of this Item Held Elsewhere

Link to Publisher Copy

Abstract

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.

Information about this Version

This is a Published version
This version's date is: 1995
This item is peer reviewed

Link to this Version

https://repository.royalholloway.ac.uk/items/4b40cbb7-7f39-e9e2-3483-41bb3c6ab869/1/

Item TypeJournal Article
TitleWeakly Hamiltonian-connected ordinary multipartite tournaments.
AuthorsGutin, Gregory
Bang-Jensen, J.
Huang, J.
Uncontrolled Keywordsmultipartite tournaments, Hamiltonian paths
DepartmentsFaculty of Science\Computer Science

Identifiers
doi10.1016/0012-365X(94)00188-O

Deposited by () on 23-Dec-2009 in Royal Holloway Research Online.Last modified on 25-May-2010

Details