An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits

@article{Bermond1974AnAO,
  title={An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits},
  author={Jean-Claude Bermond},
  journal={Discrete Mathematics},
  year={1974},
  volume={8},
  pages={301-304}
}
In this paper, we show that if K,* denotes the symmetric oriented complete graph on n vertices, with n f 6, then we can partition the arcs of Kg into oriented 3-circuits if and only if n(n-1) = 0 (mod 3). We use the solution of Kirkman’s schoolgirl problem given by Ray-Chaudhuri and Wilson [l]. An oriented graph G is a pair (X, U), where X is a finite set… CONTINUE READING