We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Amalgamations of factorizations of complete graphs.

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=(k_1, \ldots, k_t)$ and $L=(l_1, \ldots, l_t)$ be collections of nonnegative integers. A $(t,K,L)$-factor\-ization of a graph is a decomposition of the graph into factors $F_1, \ldots , F_t$ such that $F_i$ is $k_i$-regular and $l_i$-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 $K_m$ in a $(t,K,L)$-factorization of $K_n$.

Item Type:Article
Keywords:Graphs, Factorizations, Algorithms.
Full text:Full text not available from this repository.
Publisher Web site:
Record Created:31 Jan 2007
Last Modified:01 Apr 2010 22:41

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library