-
77浏览
-
0点赞
-
0收藏
-
0分享
-
39下载
-
0评论
-
引用
期刊论文
Kp,q-factorization of complete bipartite graphs
Science in China Ser. A Mathematics 2004, Vol. 47 No. 3, 473-479,-0001,():
Let Km,n be a complete bipartite graph with two partite sets having m and n vertices, respectively. A Kp,q factorizeation of Km,n is a set of edge-disjoint Kp,q-factors of Km,n which partition the set of edges of Km,n. When p=1 and q is a prime number, Wang, in his paper “On K1,k-factorizations of a complete bipartite graph” (Discrete Math, 1994, 126: 359-364), investigated the K1,q-factorization of Km,n and gave a sufficient condition for such a factorizeation to exist. In the paper “K1,k-factorizations of complete bipartite graphs” (Discrete Math, 2002, 259: 301-306), Du and Wang extended Wang’s result to the case that q is any positive integer. In this paper, we give a sufficient condition for Km,n to have a Kp,q-factorization. As a special case, it is shown that the Martin’s BAC conjecture is true when p:q=k:(k+1) for any positive integer k.
【免责声明】以下全部内容由[杜北梁]上传于[2007年03月09日 16时04分08秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果