二部图的K_(1,4)-因子分解(英文)

K_(1,4)-factorization of bipartite graphs

Km .n的K1.k 因子分解问题已被多位研究者所研究 ,当k=2 时Km .n具有K1.2 因子分解的存在性问题已被Ushio完全解决 当k=3时Wang研究了Km .n的K1.3 因子分解问题 ,并给出了Km .n具有K1.3 因子分解的一个充分条件 本文研究Km .n 的K1.4 因子分解问题 ,并给出Km .n 具有K1.4

The K 1,k -factorization of complete bipartite graph K m,n has been studied by several researchers.When k=2,the spectrum problem for K 1,2 -factorization of K m,n has been completely solved by Ushio.When k=3, Wang investigated K 1,3 -factorization of K m,n and gave a sufficient condition for such a factorization to exist.In this paper,we investigate K 1,4 -factorization of K m,n ,and give a sufficient condition for such a factorization to exist.