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

K1,pk-factorization of complete bipartite graphs

โœ Scribed by Du Beiliang

Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
2001
Tongue
English
Weight
152 KB
Volume
16
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

K1,k-factorization of bipartite graphs
K1,k-factorization of bipartite graphs
โœ Du Beiliang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› SP Editorial Committee of Applied Mathematics - A ๐ŸŒ English โš– 201 KB
Ck-factorization of complete bipartite g
Ck-factorization of complete bipartite graphs
โœ Hikoe Enomoto; Takashi Miyamoto; Kazuhiko Ushio ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 141 KB
P3-Factorization of complete bipartite g
P3-Factorization of complete bipartite graphs
โœ 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 K1,k-factorizations of a complete bip
On K1,k-factorizations of a complete bipartite graph
โœ Hong Wang ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 311 KB

We present a necessary condition for a complete bipartite graph K,., to be K,.,-factorizable and a sufficient condition for K,,, to have a K,,,-factorization whenever k is a prime number. These two conditions provide Ushio's necessary and sufficient condition for K,,, to have a K,,,-factorization.