𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian

✍ Scribed by Yubao Guo; Meike Tewes; Lutz Volkmann; Anders Yeo

Book ID
108316399
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
92 KB
Volume
212
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sufficient condition for a semicomplet
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
✍ JΓΈrgen Bang-Jensen; Gregory Gutin; Jing Huang πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 670 KB

A multipartite tournament is an orientation of a complete k-partite graph for some k >~ 2. A factor of a digraph D is a collection of vertex disjoint cycles covering all the vertices of D. We show that there is no degree of strong connectivity which together with the existence of a factor will guara

Sufficient conditions for a digraph to b
Sufficient conditions for a digraph to be Hamiltonian
✍ Bang-Jensen, JοΏ½rgen; Gutin, Gregory; Li, Hao πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 412 KB πŸ‘ 2 views

We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this type combine local structure of the digraph with conditions on the degrees of nonadjacent vertices. The main difference from earlier conditions is that we do not require a degree condition on all pairs