𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quasi-hamiltonian paths in semicomplete multipartite digraphs

✍ Scribed by Bang-Jensen, Jørgen; Maddaloni, Alessandro; Simonsen, Sven

Book ID
120229450
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
411 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Kings in semicomplete multipartite digra
Kings in semicomplete multipartite digraphs
✍ Gutin, Gregory; Yeo, Anders 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicomplete p-partite digraph, or just a semicomplete multipartite digraph. A semicomplete multipartite digraph with no cycle of length two is

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

One-diregular subgraphs in semicomplete
One-diregular subgraphs in semicomplete multipartite digraphs
✍ Yeo, Anders 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

The problem of finding necessary and sufficient conditions for a semicomplete multipartite digraph (SMD) to be Hamiltonian, seems to be both very interesting and difficult. Bang-Jensen, Gutin and Huang (Discrete Math to appear) proved a sufficient condition for a SMD to be Hamiltonian. A strengtheni