We prove that any complete multipartite graph with parts of even size can be decomposed into closed trails with prescribed even lengths.
Decompositions of Complete Multipartite Graphs into Cycles of Even Length
β Scribed by Nicholas J. Cavenagh; Elizabeth J. Billington
- Publisher
- Springer Japan
- Year
- 2000
- Tongue
- English
- Weight
- 205 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
## Abstract For all odd integers __n__ββ₯β1, let __G~n~__ denote the complete graph of order __n__, and for all even integers __n__ββ₯β2 let __G~n~__ denote the complete graph of order __n__ with the edges of a 1βfactor removed. It is shown that for all nonβnegative integers __h__ and __t__ and all p