Unbalanced bipartite factorizations of complete bipartite graphs

被引：4
|
作者：
Martin, Nigel [1 ]
机构：
[1] Univ Durham, Dept Math Sci, Durham DH1 3LE, England
来源：
DISCRETE MATHEMATICS | 2006年 / 306卷 / 17期
关键词：
factorization; complete bipartite graph;
D O I：
10.1016/j.disc.2006.04.004
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We construct a new infinite family of factorizations of complete bipartite graphs by factors all of whose components are copies of a (fixed) complete bipartite graph K-p,K-q. There are simple necessary conditions for such factorizations to exist. The family constructed here demonstrates sufficiency in many new cases. In particular, the conditions are always sufficient when q = p + 1. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：2084 / 2090
页数：7
相关论文
共 50 条
12345