Part of the Lecture Notes in Mathematics book series (LNM, volume 686)
Decompositions of complete symmetric digraphs into the four oriented quadrilaterals
We provide necessary and sufficient conditions for the existence of a decomposition of the set of arcs of a complete symmetric digraph into each of the four oriented quadrilaterals.
Unable to display preview. Download preview PDF.
- J.C. Bermond and D. Sotteau, Graph decompositions and G-designs. Proc. 5th British Combinatorial Conf., U.M.P.I., Winnipeg (1976) 53–72.Google Scholar
- F. Harary, R.W. Robinson and N.C. Wormald, Isomorphic factorisations I: Complete graphs. Trans. Amer. Math. Soc. (to appear).Google Scholar
- F. Harary and W.D. Wallis, Isomorphic factorizations II: Combinatorial designs. Proc. 8th S.E. Conf. Combinatorics, Graph Theory and Computing, U.M.P.I., Winnipeg (to appear).Google Scholar
- N.S. Mendelsohn, A natural generalization of Steiner triple systems. Computers in Number Theory, Academic Press, New York (1971) 323–338.Google Scholar
© Springer-Verlag 1978