Decomposition of the complete directed graph into k-circuits
- 1 October 1976
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 21 (2) , 146-155
- https://doi.org/10.1016/0095-8956(76)90055-1
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Partition of the edges of the directed complete graph into 4-cyclesDiscrete Mathematics, 1975
- An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuitsDiscrete Mathematics, 1974
- An existence theory for pairwise balanced designs II. The structure of PBD-closed sets and the existence conjecturesJournal of Combinatorial Theory, Series A, 1972
- On the cyclic decompositions of the complete graph into polygons with odd number of edgesČasopis pro pěstování matematiky, 1966
- Sequences in groups with distinct partial productsPacific Journal of Mathematics, 1961
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNSAnnals of Eugenics, 1939