| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651408 | Discrete Mathematics | 2006 | 7 Pages |
Abstract
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 Kp,qKp,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+1q=p+1.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nigel Martin,