Amalgamations of factorizations of complete graphs

Authors:
Matthew Johnson
Affiliations:
Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham DH1 3LE, UK
Venue:
Journal of Combinatorial Theory Series B
Year:
2007

Citing 5
Cited 1

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
Embedding edge-colorings into 2-edge-connected k-factorizations of Kkn+1

Journal of Graph Theory
Amalgamations of connected k-factorizations

Journal of Combinatorial Theory Series B
An algorithm for finding factorizations of complete graphs

Journal of Graph Theory

Multiply balanced edge colorings of multigraphs

Journal of Graph Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

Let t be a positive integer, and let K=(k"1,...,k"t) and L=(l"1,...,l"t) be collections of nonnegative integers. A (t,K,L)-factorization of a graph is a decomposition of the graph into factors F"1,...,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.