Publisher
Hiroshima University - Department of Mathematics
Subject
Geometry and Topology,Algebra and Number Theory,Analysis
Reference20 articles.
1. [16] S. Yamamoto, H. Ikeda, S. Shige-eda, K. Ushio and N. Hamada, On claw-decomposition of complete graphs and complete bigraphs, Hiroshima Math. J. 5 (1975), 33-42.
2. [17] S. Yamamoto, H. Ikeda, S. Shige-eda, K. Ushio and N. Hamada, Design of a new balanced file organization scheme with the least redundancy, Information and Control 28 (1975), 156-175.
3. [1] J. C. Bermond, Decomposition of the complete directed graph into ^-circuits, J. Combinatorial Theory (B) 21 (1976), 146-155.
4. [2] J. C. Bermond and J. Schonheim, (/-decomposition of Kn9 where G has four vertices or less, Discrete Math. 19 (1977), 113-120.
5. [3] J. C. Bermond and D. Sotteau, Graph decompositions and (/-designs, Proc. 5-/A British Combinatorial Conf. (1975), 53-72.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complete Multipartite Graphs Decompositions Using Mutually Orthogonal Graph Squares;International Journal of Applied and Computational Mathematics;2023-08-26
2. The existence of perfect -triple systems;Journal of Statistical Planning and Inference;2008-12
3. G-designs and related designs;Discrete Mathematics;1993-06
4. Bipartite decomposition of complete multipartite graphs;Hiroshima Mathematical Journal;1981-01-01