zbMATH — the first resource for mathematics

\(G\)-decomposition of \(K_n\), where G has four vertices or less. (English) Zbl 0376.05016

05B30 Other designs, configurations
05C99 Graph theory
Full Text: DOI
[1] Bermond, J.C., Cycles dans LES graphes et G-configurations, () · Zbl 0317.05107
[2] Bermond, J.C.; Sotteau, D., Graph decomposition and G-designs, Proc 5th british combinatorial conference, Aberdeen, 53-72, (1975)
[3] Cain, P., Decomposition of complete graphs into stars, Bull. austral. math. soc., 10, 23-30, (1974) · Zbl 0263.05120
[4] Erdös, P.; Schönheim, J., Edge decomposition of the complete graph into copies of a connected graph, Algebraic aspects of combinatorics, 271-278, (1975), Proc. Toronoto
[5] Fort, M.U.; Hedlund, G.A., Minimal coverings of pairs by triples, Pacific J. math., 8, 709-719, (1958) · Zbl 0084.01401
[6] Hanani, H., The existence and construction of balanced incomplete block designs, Ann. math. statist., 32, 361-386, (1961) · Zbl 0107.36102
[7] Hanani, H., Balanced incomplete block designs and related designs, Discrete math., 11, 255-369, (1975) · Zbl 0361.62067
[8] Hell, P.; Rosa, A., Graph decompositions, handcuffed prisoners and balanced p-designs, Discrete math., 2, 252-299, (1972) · Zbl 0251.05015
[9] C. Huang, Balanced graph designs in small graphs, Utilitas Math. to appear.
[10] Kotzig, A., On the decomposition of complete graphs into 4k- gons, Mat. fyz. casop., 15, 229-233, (1965) · Zbl 0134.43402
[11] Wilson, R.M., Decompositions of complete graphs into subgraphs isomorphic to a given graph, Proc. 5th british combinatorial conference, Aberdeen, 647-659, (1975)
[12] Sumiyasu, Yamomoto, On claw-decomposition of complete graphs and complete bigraphs, Hiroshima math. J., 5, 33-42, (1975) · Zbl 0297.05143
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.