Complete bipartite factorisations of Kn,n

Martin, Nigel

Abstract

We continue the study of complete factorisations of complete bipartite graphs of the form Kn,n by factors whose components are copies of Kp,q for given, fixed, p

Citation

Martin, N. (2003). Complete bipartite factorisations of Kn,n. Discrete Mathematics, 266(1-3), 353-375. https://doi.org/10.1016/s0012-365x%2802%2900819-1

• Journal Article Type: Article
• Publication Date: 2003-05
• Deposit Date: Mar 26, 2008
• Journal: Discrete mathematics.
• Print ISSN: 0012-365X
• Electronic ISSN: 2578-9252
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 266
• Issue: 1-3
• Pages: 353-375
• DOI: https://doi.org/10.1016/s0012-365x%2802%2900819-1
• Keywords: Factorisation, Complete bipartite graph.
• Public URL: https://durham-repository.worktribe.com/output/1628864
• Publisher URL: http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V00-48PDR2J-11-KM&_cdi=5632&_user=121711&_orig=browse&_coverDate=05%2F06%2F2003&_sk=997339998&view=c&wchp=dGLbVtz-zSkWb&md5=50caabd183d255752664bf506fcb91b2&ie=/sdarticle.pdf