𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gallai colorings and domination in multipartite digraphs

✍ Scribed by András Gyárfás; Gábor Simonyi; Ágnes Tóth

Book ID
112121095
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
217 KB
Volume
71
Category
Article
ISSN
0364-9024

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

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