𝔖 Bobbio Scriptorium
✦   LIBER   ✦

P3-factorization of complete multipartite graphs

✍ Scribed by Kazuhiko Ushio; Reiji Tsuruno


Publisher
Springer Japan
Year
1989
Tongue
English
Weight
182 KB
Volume
5
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


P3-Factorization of complete bipartite g
✍ Kazuhiko Ushio πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 344 KB

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.

On path factorizations of complete multi
✍ Min-li Yu πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 523 KB

## 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

Factorizations of complete multipartite
✍ El--Zanati, S.; Vanden Eynden, C. πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 100 KB πŸ‘ 2 views

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

Nondisconnecting disentanglements of ama
✍ C. D. Leach; C. A. Rodger πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 126 KB

## Abstract In this paper necessary and sufficient conditions are found for an edge‐colored graph __H__ to be the homomorphic image of a 2‐factorization of a complete multipartite graph __G__ in which each 2‐factor of __G__ has the same number of components as its corresponding color class in __H__