Weakly Hamiltonian-connected ordinary multipartite tournaments.

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

Open link

Publication date

January 1995

DOI

10.1016/0012-365X(94)00188-O

Publisher

Elsevier BV

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

Extracted data

We use cookies to provide a better user experience.

Data Protection

Weakly Hamiltonian-connected ordinary multipartite tournaments.

Abstract

Extracted data

Weakly Hamiltonian-connected ordinary multipartite tournaments.

Abstract

Extracted data

Related items

Related items