๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Hamiltonian decomposition of complete regular multipartite digraphs

โœ Scribed by Lenhard L Ng

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
268 KB
Volume
177
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

We prove that the complete regular multipartite digraph K* is decomposable into directed r;s

๐Ÿ“œ SIMILAR VOLUMES

Hamiltonian decompositions of complete r
Hamiltonian decompositions of complete regular s-partite graphs
โœ A.J.W. Hilton; C.A. Rodger ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 962 KB

In this paper we give a procedure by which Hamiltonian decompositions of the s-partite graph K~.....,~, where (s-1)n is even, can be constructed. For 2t<~s, l<~al<~...<~a~n, we find conditions which are necessary and sufficient for a decomposition of the edge-set of Kal.a2..... ~ into (s-1)n/2 class

Characterizations of vertex pancyclic an
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
โœ G. Gutin ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 527 KB

A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a complete multipartite graph. Such a digraph D is called ordinary if for any pair X, Y of its partite sets the set of arcs with both end vert

Fair Hamilton Decompositions of Complete
Fair Hamilton Decompositions of Complete Multipartite Graphs
โœ C.D. Leach; C.A. Rodger ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 88 KB

A fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycles in G whose edges partition the edges of G in such a way that, for each pair of parts and for each pair of hamilton cycles H 1 and H 2 , the difference in the number of edges in H 1 and H 2 joining vertices