P3-factorization of complete multipartite graphs
โ Scribed by Du Beiliang
- Book ID
- 107502206
- Publisher
- SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
- Year
- 1999
- Tongue
- English
- Weight
- 123 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1005-1031
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
P,-factorization of K,,,, is (i) m + n -0 (mod 3), (ii) m < 2n, (iii) n s 2m and (iv) 3mn/2(m + n) is an integer.
## Necessary conditions for IK(n, r), the complete multipartite graph with r parts of size n in which each edge has multiplicity 1, to have a P,-factorization are nr=O(mod k) and i(r-l)kn=O(mod2(k-1)). We show that when n=O(modk) or r=O(modk), these two conditions are also sufficient. (This impli
For a positive integer d, the usual d-dimensional cube Q d is defined to be the graph (K 2 ) d , the Cartesian product of d copies of K 2 . We define the generalized cube Q(K k , d) to be the graph (K k ) d for positive integers d and k. We investigate the decomposition of the complete multipartite