𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs

✍ Scribed by Lu, Mei; Guo, Yubao; Surmacs, Michel

Book ID
121260808
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
381 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Strongly Hamiltonian-connected locally s
Strongly Hamiltonian-connected locally semicomplete digraphs
✍ Guo, Yubao πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 513 KB

We give some sufficient conditions for locally semicomplete digraphs to contain a hamiltonian path from a prescribed vertex to another prescribed vertex. As an immediate consequence of these, we obtain that every 4-connected locally semicomplete digraph is strongly hamiltonian-connected. Our results

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 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