Amalgamations of factorizations of complete equipartite graphs,

Hilton, A.J.W.; Johnson, Matthew

Abstract

Let t be a positive integer, and let L=(l1,…,lt) and K=(k1,…,kt) be collections of nonnegative integers. A graph has a (t,K,L) factorization if it can be represented as the edge-disjoint union of factors F1,…,Ft where, for 1it, Fi is ki-regular and at least li-edge-connected. In this paper we consider (t,K,L)-factorizations of complete equipartite graphs. First we show precisely when they exist. Then we solve two embedding problems: we show when a factorization of a complete σ-partite graph can be embedded in a (t,K,L)-factorization of a complete s-partite graph, σ

Citation

Hilton, A., & Johnson, M. (2004). Amalgamations of factorizations of complete equipartite graphs,. Discrete Mathematics, 284(1-3), 157-175. https://doi.org/10.1016/j.disc.2003.11.030

• Journal Article Type: Article
• Publication Date: Jul 1, 2004
• Deposit Date: Oct 7, 2009
• Publicly Available Date: Oct 14, 2009
• Journal: Discrete mathematics.
• Print ISSN: 0012-365X
• Electronic ISSN: 2578-9252
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 284
• Issue: 1-3
• Pages: 157-175
• DOI: https://doi.org/10.1016/j.disc.2003.11.030
• Public URL: https://durham-repository.worktribe.com/output/1580739
• Publisher URL: http://tinyurl.com/gkjhc