Cubic factorizations

We use 1-factorizations of K 6 n + 4 and a labeling scheme to prove that certain infinite sequences of cubic graphs factorize the complete graphs K 6 n + 4 . We conclude with a new constrained Round-Robin scheduling problem that was used in some of our constructions.