Nigel Martin
Unbalanced bipartite factorizations of complete bipartite graphs
Martin, Nigel
Authors
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 $K_{p,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$.
Citation
Martin, N. (2006). Unbalanced bipartite factorizations of complete bipartite graphs. Discrete Mathematics, 306(17), 2084-2090. https://doi.org/10.1016/j.disc.2006.04.004
Journal Article Type | Article |
---|---|
Publication Date | 2006-09 |
Deposit Date | Mar 26, 2008 |
Publicly Available Date | Mar 29, 2024 |
Journal | Discrete mathematics. |
Print ISSN | 0012-365X |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 306 |
Issue | 17 |
Pages | 2084-2090 |
DOI | https://doi.org/10.1016/j.disc.2006.04.004 |
Keywords | Factorization, Complete bipartite graph. |
Files
Accepted Journal Article
(142 Kb)
PDF
You might also like
Unbalanced star-factorisations of complete bipartite graphs
(2004)
Journal Article
Permutation separations and complete bipartite factorizations of Kn,n
(2003)
Journal Article
Complete bipartite factorisations of Kn,n
(2003)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search