Amalgamations of connected k-factorizations

Authors:
A. J. W. Hilton;Matthew Johnson;C. A. Rodger;E. B. Wantland
Affiliations:
Department of Mathematics, University of Reading, P.O. Box 220, Reading, RG6 6AX, UK;Department of Mathematics, University of Reading, P.O. Box 220, Reading, RG6 6AX, UK;Department of Discrete and Statistical Sciences, 120 Math Annex, Auburn University, Auburn, AL;Department of Mathematics, University of Montana Western College, Dillon, MT
Venue:
Journal of Combinatorial Theory Series B
Year:
2003

Citing 6
Cited 2

Hamiltonian decompositions of complete regular s-partite graphs

Discrete Mathematics
Amalgamations of almost regular edge-colourings of simple graphs

Journal of Combinatorial Theory Series A
The embedding of partial triple systems when 4 Divides &lgr;

Journal of Combinatorial Theory Series A
A partial m=(2k+1)-cycle system of order n can be embedded in an m-cycle system of order (2n+1)m

Discrete Mathematics
Embedding edge-colorings into 2-edge-connected k-factorizations of Kkn+1

Journal of Graph Theory
Cycle decomposition of Kn and Kn-1

Journal of Combinatorial Theory Series B

Amalgamations of factorizations of complete graphs

Journal of Combinatorial Theory Series B
Multiply balanced edge colorings of multigraphs

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, necessary and sufficient conditions are found for a graph with exactly one amalgamated vertex to be the amalgamation of a k-factorization of Kkn+1 in which each k factor is connected. From this result, necessary and sufficient conditions for a given edge-coloured Kt to be embedded in a connected k-factorization of Kkn+1 are deduced.