Johnson, M. (2007) 'Amalgamations of factorizations of complete graphs.', Journal of combinatorial theory, series B., 97 (4). pp. 597-611.
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.
|Keywords:||Graphs, Factorizations, Algorithms.|
|Full text:||(AM) Accepted Manuscript|
Available under License - Creative Commons Attribution Non-commercial No Derivatives.
Download PDF (171Kb)
|Publisher Web site:||http://dx.doi.org/10.1016/j.jctb.2006.09.004|
|Publisher statement:||© 2006 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/|
|Date accepted:||No date available|
|Date deposited:||11 December 2015|
|Date of first online publication:||July 2007|
|Date first made open access:||No date available|
Save or Share this output
|Look up in GoogleScholar|