𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decompositions of complete multipartite graphs

✍ Scribed by Peter J. Cameron

Book ID
108114100
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
184 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Hamilton decompositions of complete mult
Hamilton decompositions of complete multipartite graphs with any 2-factor leave
✍ C. D. Leach; C. A. Rodger πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 85 KB πŸ‘ 1 views

## Abstract For __m__ β‰₯ 1 and __p__ β‰₯ 2, given a set of integers __s__~1~,…,__s__~__q__~ with $s\_j \geq p+1$ for $1 \leq j \leq q$ and ${\sum \_{j\,=\,1}^q} s\_j = mp$, necessary and sufficient conditions are found for the existence of a hamilton decomposition of the complete __p__‐partite graph $