Hilton, A. J. W. and Johnson, M. and Rodger, C. A. and Wantland, E. B. (2003) 'Amalgamations of connected k<-factorizations.', Journal of combinatorial theory, series B., 88 (2). pp. 267-279.
In this paper, necessary and sufficient conditions are found for a graph with exactly one amalgamated vertex to be the amalgamation of a <i>k</i>-factorization of <i>K<sub>kn+1</sub></i> in which each <i>k</i>-factor is connected. From this result, necessary and sufficient conditions for a given edge-coloured <i>K<sub>t</sub></i> to be embedded in a connected <i>k</i>-factorization of <i>K<sub>kn+1</sub></i> are deduced.
|Full text:||Full text not available from this repository.|
|Publisher Web site:||http://dx.doi.org/10.1016/S0095-8956(03)00030-3|
|Record Created:||26 Mar 2008|
|Last Modified:||01 Apr 2010 22:42|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|