K1,k-factorization of bipartite graphs
Tóm tắt
In this paper, a necessary condition for a bipartite graph λKm,n to be K
1.k
-factorizable and a sufficient condition for kK
m,n
to have a K
1,k
-factorization whenever k is a prime number are given.
Tài liệu tham khảo
Bondy, J. A. and Murty. U. S. R., Graph Theory with Applications, Macmillan Press, London and Basingstoke, 1976.
Ushio, K., P 3-factorization of complete bipartite graphs, Discrete Math., 72(1988), 361–366.
Ushio, K., G-designs and related designs, Discrete Math., 116(1993), 299–311.
Ushio, K. and Tsuruno, R., Cyclic Sk-factorization of complete bipartite graphs, Graph Theory, Combinatorics. Algorithm and Applications, SI AM. (1991). 557–563.
Wang, H.. On K-factorizations of a complete bipartite graph. Discrete Math., 126(1994).359–364.