Edge partitions of the complete symmetric directed graph and related designs-Reference-Cited by-同舟云学术

Edge partitions of the complete symmetric directed graph and related designs

Published:1981-06 Issue:2 Volume:40 Page:118-128
ISSN:0021-2172
Container-title:Israel Journal of Mathematics
language:en
Short-container-title:Israel J. Math.

Author:

Alspach Brian,Heinrich Katherine,Rosenfeld Moshe

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/BF02761904.pdf

Reference13 articles.

1. J.-C. Bermond and V. Faber,Decomposition of the complete directed graph into k-circuits, J. Combinatorial Theory Ser. B,21 (1976), 146–155.

2. J.-C. Bermond and D. Sotteau,Graph decompositions and G-designs, Proc. Fifth British Combinatorial Conf., Aberdeen (1975), Congressus Num. XV, Utilitas Math. Winnipeg, pp. 53–72.

3. J. A. Bondy and U. S. R. Murty,Graph Theory with Applications, Macmillan, London, 1976.

4. R. K. Brayton, Don Coppersmith and A. J. Hoffman,Self-orthogonal latin squares, Teorie Combinatorie, Rome (1973), Vol.II (1976), pp. 509–517.

5. J. Dénes and A. D. Keedwell,Latin Squares and their Applications, Akadémiai Kiado, Budapest, 1974.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Uniform decompositions of complete multigraphs into cycles;Journal of Combinatorial Designs;2018-09-27

2. Construction of Hamilton Path Tournament Designs;Graphs and Combinatorics;2011-01-05

3. On defining sets of full designs;Discrete Mathematics;2010-11

4. Brian Alspach and his work;Discrete Mathematics;2005-08

5. A Class of 2-Colorable Orthogonal Double Covers of Complete Graphs by Hamiltonian Paths;Graphs and Combinatorics;2002-03-01