𝔖 Bobbio Scriptorium
✦   LIBER   ✦

How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?

✍ Scribed by Anders Yeo


Publisher
Springer Japan
Year
1999
Tongue
English
Weight
130 KB
Volume
15
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A sufficient condition for a semicomplet
✍ 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