Amalgamations of factorizations of complete graphs

Johnson, M.

Abstract

Let t be a positive integer, and let K=(k1,…,kt) and L=(l1,…,lt) be collections of nonnegative integers. A (t,K,L)-factorization of a graph is a decomposition of the graph into factors F1,…,Ft such that Fi is ki-regular and li-edge-connected. In this paper, we apply the technique of amalgamations of graphs to study (t,K,L)-factorizations of complete graphs. In particular, we describe precisely when it is possible to embed a factorization of Km in a (t,K,L)-factorization of Kn.

Citation

Johnson, M. (2007). Amalgamations of factorizations of complete graphs. Journal of Combinatorial Theory, Series B, 97(4), 597-611. https://doi.org/10.1016/j.jctb.2006.09.004

• Journal Article Type: Article
• Publication Date: Jul 1, 2007
• Deposit Date: Jan 31, 2007
• Publicly Available Date: Dec 11, 2015
• Journal: Journal of Combinatorial Theory, Series B
• Print ISSN: 0095-8956
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 97
• Issue: 4
• Pages: 597-611
• DOI: https://doi.org/10.1016/j.jctb.2006.09.004
• Keywords: Graphs, Factorizations, Algorithms.
• Public URL: https://durham-repository.worktribe.com/output/1576765