Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments

Bangjensen, J.
Manoussakis, Y.

Open PDF

Open link

Publication date

March 1995

DOI

10.1006/jctb.1995.1019

Publisher

Academic Press.

ISSN

0095-8956

Citation count (estimate)

Abstract

AbstractWe 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

Extracted data

We use cookies to provide a better user experience.

Data Protection

Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments

Abstract

Extracted data

Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments

Abstract

Extracted data

Related items

Related items