Weakly hamiltonian-connected vertices in bipartite tournaments
type: Item
instance of: scholarly article
title: Weakly hamiltonian-connected vertices in bipartite tournaments
zbMATH Open document ID: 0820.05027
author: Y. Manoussakis
author: Jørgen Bang-Jensen
published in: Journal of Combinatorial Theory. Series B
publication date: 1995-07-02T00:00:00Z
review text: We 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.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 767694
zbMATH Keywords: tournaments
zbMATH Keywords: hamiltonian path
zbMATH Keywords: polynomial algorithm
reviewed by: Jørgen Bang-Jensen
MaRDI profile type: Publication
full work available at URL: jctb.1995.1019
OpenAlex ID: W2028252114
DOI: 10.1006/JCTB.1995.1019
description: scientific article; zbMATH DE number 767694