Contents

-

Some 2-Coloured 5-Cycle Decompositions

Mary Waterhouse1, James Lefevre1
1Department of Mathematics The University of Queensland Qld 4072 Australia

Abstract

Let C be the set of distinct ways in which the vertices of a 5-cycle may be coloured with at most two colours, called \emph{colouring types}, and let SC. Suppose we colour the vertices of Kv with at most two colours. If D is a 5-cycle decomposition of Kv, such that the colouring type of each 5-cycle is in S, and every colouring type in S is represented in D, then D is said to have a \emph{proper colouring type} S. For all S with |S|2, we determine some necessary conditions for the existence of a 5-cycle decomposition of Kv with proper colouring type S. In many cases, we show that these conditions are also sufficient.