𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Weakly Hamiltonian-connected ordinary multipartite tournaments

✍ Scribed by Jørgen Bang-Jensen; Gregory Gutin; Jing Huang

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
614 KB
Volume
138
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 tournament and finds one, if it exists.

📜 SIMILAR VOLUMES

Weakly Hamiltonian-Connected Vertices in
Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments
✍ J. Bangjensen; Y. Manoussakis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 768 KB

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.

Weakly Hamiltonian-connected locally sem
Weakly Hamiltonian-connected locally semicomplete digraphs
✍ Bang-Jensen, J�rgen; Guo, Yubao; Volkmann, Lutz 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

We characterize weakly hamiltonian-connected locally semicomplete digraphs.

A remark on cycles through an arc in str
A remark on cycles through an arc in strongly connected multipartite tournaments
✍ Lutz Volkmann 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 140 KB

A multipartite or c-partite tournament is an orientation of a complete c-partite graph. In this note we prove that a strongly connected c-partite tournament with c ≥ 3 contains an arc that belongs to a directed cycle of length m for every m ∈ {3, 4, . . . , c}.