✦ LIBER ✦

Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments

✍ Scribed by J. Bangjensen; Y. Manoussakis

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 768 KB
Volume: 63
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1019

No coin nor oath required. For personal study only.

✦ Synopsis

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. (C) 1995 Academic Press. Inc.

📜 SIMILAR VOLUMES

Weakly Hamiltonian-connected ordinary mu

Weakly Hamiltonian-connected ordinary multipartite tournaments

✍ Jørgen Bang-Jensen; Gregory Gutin; Jing Huang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 614 KB

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 ofa Hamiltonian path connecting two given vertices in an ordinary multipartite tourna