K1,p(2)-factorization of complete bipartite graphs

被引：21
|
作者：
Du, B [1 ]
机构：
[1] Suzhou Univ, Dept Math, Suzhou 215006, Peoples R China
来源：
DISCRETE MATHEMATICS | 1998年 / 187卷 / 1-3期
关键词：
complete bipartite graph; factorization;
D O I：
10.1016/S0012-365X(97)00264-1
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this note, we investigate the factorization of a bipartite multigraph lambda K-m,K-n into copies of K-1,K-p2 whenever p is a prime number. We give a trivial necessary condition for such a factorization to exist and a sufficient condition for the cases lambda = 1, lambda = p and lambda = p(2). (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：273 / 279
页数：7
相关论文
共 50 条
12345